10 research outputs found
Quantifier elimination and other model-theoretic properties of BL-algebras
This work presents a model-theoretic approach to the study of firstorder theories of classes of BL-chains. Among other facts, we present several classes of BL-algebras, generating the whole variety of BL-algebras whose firstorder theory has quantifier elimination. Model-completeness and decision problems are also investigated. Then we investigate classes of BL-algebras having (or not having) the amalgamation property or the joint embedding property and we relate the above properties to the existence of ultrahomogeneous models. © 2011 by University of Notre Dame.Peer Reviewe
Order, algebra, and structure: lattice-ordered groups and beyond
This thesis describes and examines some remarkable relationships existing between seemingly quite different properties (algebraic, order-theoretic, and structural) of ordered groups. On the one hand, it revisits the foundational aspects of the structure theory of lattice-ordered groups, contributing a novel systematization of its relationship with the theory of orderable groups. One of the main contributions in this direction is a connection between validity in varieties of lattice-ordered groups, and orders on groups; a framework is also provided that allows for a systematic account of the relationship between orders and preorders on groups, and the structure theory of lattice-ordered groups. On the other hand, it branches off in new directions, probing the frontiers of several different areas of current research. More specifically, one of the main goals of this thesis is to suitably extend results that are proper to the theory of lattice-ordered groups to the realm of more general, related algebraic structures; namely, distributive lattice-ordered monoids and residuated lattices. The theory of lattice-ordered groups provides themain source of inspiration for this thesis’ contributions on these topics
On some axiomatic extensions of the monoidal T-norm based logic MTL : an analysis in the propositional and in the first-order case
The scientific area this book belongs to are many-valued logics: in particular, the logic MTL and some of its extensions, in the propositional and in the first-order case. The book is divided in two parts: in the first one the necessary background about these logics, with some minor new results, are presented. The second part is devoted to more specific topics: there are five chapters, each one about a different problem. In chapter 6 a temporal semantics for Basic Logic BL is presented. In chapter 7 we move to first-order logics, by studying the supersoundness property: we have improved some previous works about this theme, by expanding the analysis to many extensions of the first-order version of MTL. Chapter 8 is dedicated to four different families of n-contractive axiomatic extensions of BL, analyzed in the propositional and in the first-order case: completeness, computational and arithmetical complexity, amalgamation and interpolation properties are studied. Finally, chapters 9 and 10 are about Nilpotent Minimum logic: in chapter 9 the sets of tautologies of some NM-chains (subalgebras of [0,1]_NM) are studied, compared and the problems of axiomatization and undecidability are tackled. Chapter 10, instead, concerns some logical and algebraic properties of (propositional) Nilpotent Minimum logic. The results (or an extended version of them) of these last chapters have been also presented in papers
ON SOME AXIOMATIC EXTENSIONS OF THE MONOIDAL T-NORM BASED LOGIC MTL: AN ANALYSIS IN THE PROPOSITIONAL AND IN THE FIRST-ORDER CASE
The scientific area this thesis belongs to are many-valued logics: in particular, the logic MTL and some of its extensions, in the propositional and in the first-order case (see [8],[9],[6],[7]). The thesis is divided in two parts: in the first one the necessary background about these logics,
with some minor new results, are presented. The second part is devoted to more specific topics: there are five chapters, each one about a different problem. In chapter 6 a temporal semantics for Basic Logic BL is
presented. In chapter 7 we move to first-order logics, by studying the supersoundness property: we have improved some previous works about this theme, by expanding the analysis to many extensions of the first-order version of MTL. Chapter 8 is dedicated to four different families of n-contractive axiomatic extensions of BL, analyzed in the propositional and in the first-order case: completeness, computational and arithmetical complexity, amalgamation and interpolation properties are studied. Finally, chapters 9 and 10 are about Nilpotent Minimum logic (NM, see [8]): in chapter 9 the sets of tautologies of some NM-chains (subalgebras
of [0,1]_NM) are studied, compared and the problems of axiomatization and undecidability are tackled. Chapter 10, instead, concerns some logical and algebraic properties of (propositional) Nilpotent Minimum logic. The results (or an extended version of them) of these last chapters have
been also presented in papers [1, 4, 5, 2, 3]. ---------------------------------References---------------------------------------------
[1] S. Aguzzoli, M. Bianchi, and V. Marra. A temporal semantics for Basic
Logic. Studia Logica, 92(2), 147-162, 2009. doi:10.1007/s11225-009-9192-3.
[2] M. Bianchi. First-order Nilpotent Minimum Logics: first steps. Submitted
for publication,2010.
[3] M. Bianchi. On some logical and algebraic properties of Nilpotent Minimum
logic and its relation with G\uf6del logic. Submitted for publication, 2010. [4] M. Bianchi and F. Montagna. Supersound many-valued logics and
Dedekind-MacNeille completions. Arch. Math. Log., 48(8), 719-736, 2009.
doi:10.1007/s00153-009-0145-3.
[5] M. Bianchi and F. Montagna. n-contractive BL-logics. Arch. Math. Log.,
2010. doi:10.1007/s00153-010-0213-8.
[6] P. Cintula, F. Esteva, J. Gispert, L. Godo, F. Montagna, and C. Noguera.
Distinguished algebraic semantics for t-norm based fuzzy logics: methods
and algebraic equivalencies. Ann. Pure Appl. Log., 160(1), 53-81, 2009.
doi:10.1016/j.apal.2009.01.012.
[7] P. Cintula and P. H\ue1jek. Triangular norm predicate fuzzy logics. Fuzzy Sets
Syst., 161(3), 311-346, 2010. doi:10.1016/j.fss.2009.09.006.
[8] F. Esteva and L. Godo. Monoidal t-norm based logic: Towards a
logic for left-continuous t-norms. Fuzzy sets Syst., 124(3), 271-288, 2001.
doi:10.1016/S0165-0114(01)00098-7.
[9] P. H\ue1jek. Metamathematics of Fuzzy Logic, volume 4 of Trends
in Logic. Kluwer Academic Publishers, paperback edition, 1998.
ISBN:9781402003707
Universal Proof Theory: Semi-analytic Rules and Craig Interpolation
In [6], Iemhoff introduced the notion of a focused axiom and a focused rule
as the building blocks for a certain form of sequent calculus which she calls a
focused proof system. She then showed how the existence of a terminating
focused system implies the uniform interpolation property for the logic that
the calculus captures. In this paper we first generalize her focused rules to
semi-analytic rules, a dramatically powerful generalization, and then we will
show how the semi-analytic calculi consisting of these rules together with our
generalization of her focused axioms, lead to the feasible Craig interpolation
property. Using this relationship, we first present a uniform method to prove
interpolation for different logics from sub-structural logics ,
, and to their appropriate
classical and modal extensions, including the intuitionistic and classical
linear logics. Then we will use our theorem negatively, first to show that so
many sub-structural logics including \L_n, , , and and
almost all super-intutionistic logics (except at most seven of them) do not
have a semi-analytic calculus. To investigate the case that the logic actually
has the Craig interpolation property, we will first define a certain specific
type of semi-analytic calculus which we call PPF systems and we will then
present a sound and complete PPF calculus for classical logic. However, we will
show that all such PPF calculi are exponentially slower than the classical
Hilbert-style proof system (or equivalently ). We will then
present a similar exponential lower bound for a certain form of complete PPF
calculi, this time for any super-intuitionistic logic.Comment: 45 page
Programming Languages and Systems
This open access book constitutes the proceedings of the 30th European Symposium on Programming, ESOP 2021, which was held during March 27 until April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The 24 papers included in this volume were carefully reviewed and selected from 79 submissions. They deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems
Algebraic Principles for Program Correctness Tools in Isabelle/HOL
This thesis puts forward a flexible and principled approach to the development of
construction and verification tools for imperative programs, in which the
control flow and the data level are cleanly separated. The approach is inspired
by algebraic principles and benefits from an algebraic semantics layer.
It is programmed in the Isabelle/HOL interactive theorem prover and yields
simple lightweight mathematical components as well as program construction and
verification tools that are themselves correct by construction.
First, a simple tool is implemented using Kleeene algebra with tests (KAT)
for the control flow of while-programs, which is the most compact verification
formalism for imperative programs, and their standard relational semantics for
the data level. A reference formalisation of KAT in Isabelle/HOL is then
presented, providing three different formalisations of tests. The structured
comprehensive libraries for these algebras include an algebraic account of
Hoare logic for partial correctness. Verification condition generation and
program construction rules are based on equational reasoning and supported by
powerful Isabelle tactics and automated theorem proving.
Second, the tool is expanded to support different programming features and
verification methods. A basic program construction tool is developed by adding
an operation for the specification statement and one single axiom. To include
recursive procedures, KATs are expanded further to quantales with tests,
where iteration and the specification statement can be defined explicitly.
Additionally, a nondeterministic extension supports the verification of simple
concurrent programs.
Finally, the approach is also applied to separation logic, where the
control-flow is modelled by power series with convolution as separating
conjunction. A generic construction lifts resource monoids to assertion and
predicate transformer quantales. The data level is captured by concrete
store-heap models. These are linked to the algebra by soundness proofs.
A number of examples shows the tools at work
Programming Languages and Systems
This open access book constitutes the proceedings of the 29th European Symposium on Programming, ESOP 2020, which was planned to take place in Dublin, Ireland, in April 2020, as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The actual ETAPS 2020 meeting was postponed due to the Corona pandemic. The papers deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems