Algebraic Logic for Rational Pavelka Predicate Calculus

In this paper we define the polyadic Pavelka algebras as algebraic structures for Rational Pavelka predicate calculus (RPL∀). We prove two representation theorems which are the algebraic counterpart of the completness theorem for RPL∀.     

On amalgamation of reducts of polyadic algebras

Following research initiated by Tarski, Craig and Németi, and further pursued by Sain and others, we show that for certain subsets G of w, G polyadic algebras have the strong amalgamation property. G polyadic algebras are obtained by restricting the (similarity type and) axiomatization of -dimensional polyadic algebras to finite quantifiers and substitutions in G. Using algebraic logic, we infer that some theorems of Beth, Craig and Robinson hold for certain proper extensions of first order logic (without equality).     

Effectiveness in RPL, with applications to continuous logic

In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of ?ukasiewicz logic) and continuous logic, and prove effective versions of some related theorems in model theory. We show how to reduce continuous logic to rational Pavelka logic. We also define notions of computability and decidability of a model for logics with computable, but uncountable, set of truth values; we show that provability degree of a formula with respect to a linear theory is computable, and use this to carry out an effective Henkin construction. Therefore, for any effectively given consistent linear theory in continuous logic, we effectively produce its decidable model. This is the best possible, since we show that the computable model theory of continuous logic is an extension of computable model theory of classical logic. We conclude with noting that the unique separable model of a separably categorical and computably axiomatizable theory (such as that of a probability space or an L^p Banach lattice) is decidable.     

On the complexity of axiomatizations of the class of representable quasi‐polyadic equality algebras

Using games, as introduced by Hirsch and Hodkinson in algebraic logic, we give a recursive axiomatization of the class RQPEA _α of representable quasi‐polyadic equality algebras of any dimension α. Following Sain and Thompson in modifying Andréka’s methods of splitting, to adapt the quasi‐polyadic equality case, we show that if Σ is a set of equations axiomatizing RPEA _n for $2< n <\omegaUsing games, as introduced by Hirsch and Hodkinson in algebraic logic, we give a recursive axiomatization of the class RQPEA _α of representable quasi‐polyadic equality algebras of any dimension α. Following Sain and Thompson in modifying Andréka’s methods of splitting, to adapt the quasi‐polyadic equality case, we show that if Σ is a set of equations axiomatizing RPEA _n for $2< n <\omega$ and $l< n,$ $k < n$, k′ < ω are natural numbers, then Σ contains infinitely equations in which ? occurs, one of + or · occurs, a diagonal or a permutation with index l occurs, more than k cylindrifications and more than k′ variables occur. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Equations in polyadic groups

Systems of equations and their solution sets are studied in polyadic groups. We prove that a polyadic group (G,f)?=?der_𝜃,b(G,?) is equational noetherian, if and only if the ordinary group (G,?) is equational noetherian. The structure of coordinate polyadic group of algebraic sets in equational noetherian polyadic groups is also determined.     

Fuzzy inequational logic

We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes their semantic entailment and provability in graded setting which allows to draw partially true conclusions from partially true assumptions. We follow the Pavelka approach and define general degrees of semantic entailment and provability using complete residuated lattices as structures of truth degrees. We prove the logic is Pavelka-style complete. Furthermore, we present a logic for reasoning about graded if–then rules which is obtained as particular case of the general result.     

Simple polyadic groups

The main aim of this article is to establish a characterization of simple polyadic groups in terms of ordinary groups and their automorphisms. We give two different definitions of simpleness for polyadic groups, from the point of views of universal algebra, UAS (universal algebraic simpleness), and group theory, GTS (group theoretical simpleness). We obtain necessary and sufficient conditions for a polyadic group to be UAS or GTS.     

On the definition and the representability of quasi‐polyadic equality algebras

We show that the usual axiom system of quasi polyadic equality algebras is strongly redundant. Then, so called non‐commutative quasi‐polyadic equality algebras are introduced (), in which, among others, the commutativity of cylindrifications is dropped. As is known, quasi‐polyadic equality algebras are not representable in the classical sense, but we prove that algebras in are representable by quasi‐polyadic relativized set algebras, or more exactly by algebras in .     

Cylindric algebras and finite polyadic algebras

In this survey paper the short history of cylindric and finitary polyadic algebras (term-definitionally equivalent to quasi-polyadic algebras) is sketched, and the two concepts are compared. Roughly speaking, finitary polyadic algebras constitute a subclass of cylindric algebras that include a transposition operator being strong enough. We discuss the following question: should the definition of cylindric algebras include a transposition operator? Results confirm that the existence of a transposition operator ensures representability (by relativised set algebras). The different variants of cylindric algebras including a transposition operator play an important role in the theory of cylindric-like algebras.     

Continuous fuzzy Horn logic

The paper deals with fuzzy Horn logic (FHL) which is a fragment of predicate fuzzy logic with evaluated syntax. Formulas of FHL are of the form of simple implications between identities. We show that one can have Pavelka‐style completeness of FHL w.r.t. semantics over the unit interval [0, 1] with (residuated lattices given by) left‐continuous t‐norm and a residuated implication, provided that only certain fuzzy sets of formulas are considered. The model classes of fuzzy structures of FHL are characterized by closure properties. We also give comments on related topics proposed by N. Weaver. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The class of polyadic algebras has the super amalgamation property

We show that for infinite ordinals α the class of polyadic algebras of dimension α has the super amalgamation property (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus

Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers 4 systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators, or in a more direct way, in which derivations are not translated. Both translations are closely related in a canonical way. In a preceding paper, Barendregt, Bunder and Dekkers, 1993, we proved completeness of the two direct translations. In the present paper we prove completeness of the two indirect translations by showing that the corresponding illative systems are conservative over the two systems for the direct translations. In another version, DBB (1997), we shall give a more direct completeness proof. These papers fulfill the program of Church and Curry to base logic on a consistent system of -terms or combinators. Hitherto this program had failed because systems of ICL were either too weak (to provide a sound interpretation) or too strong (sometimes even inconsistent). Received: February 15, 1996     

Cut-free formulations for a quantified logic of here and there

A predicate extension SQHT⁼ of the logic of here-and-there was introduced by V. Lifschitz, D. Pearce, and A. Valverde to characterize strong equivalence of logic programs with variables and equality with respect to stable models. The semantics for this logic is determined by intuitionistic Kripke models with two worlds (here and there) with constant individual domain and decidable equality. Our sequent formulation has special rules for implication and for pushing negation inside formulas. The soundness proof allows us to establish that SQHT⁼ is a conservative extension of the logic of weak excluded middle with respect to sequents without positive occurrences of implication. The completeness proof uses a non-closed branch of a proof search tree. The interplay between rules for pushing negation inside and truth in the “there” (non-root) world of the resulting Kripke model can be of independent interest. We prove that existence is definable in terms of remaining connectives.     

On notions of representability for cylindric‐polyadic algebras,and a solution to the finitizability problem for quantifier logics with equality

We consider countable so‐called rich subsemigroups of ; each such semigroup T gives a variety CPEA_T that is axiomatizable by a finite schema of equations taken in a countable subsignature of that of ω‐dimensional cylindric‐polyadic algebras with equality where substitutions are restricted to maps in T. It is shown that for any such T, if and only if is representable as a concrete set algebra of ω‐ary relations. The operations in the signature are set‐theoretically interpreted like in polyadic equality set algebras, but such operations are relativized to a union of cartesian spaces that are not necessarily disjoint. This is a form of guarding semantics. We show that CPEA_T is canonical and atom‐canonical. Imposing an extra condition on T, we prove that atomic algebras in CPEA_T are completely representable and that CPEA_T has the super amalgamation property. If T is rich and finitely represented, it is shown that CPEA_T is term definitionally equivalent to a finitely axiomatizable Sahlqvist variety. Such semigroups exist. This can be regarded as a solution to the central finitizability problem in algebraic logic for first order logic with equality if we do not insist on full fledged commutativity of quantifiers. The finite dimensional case is approached from the view point of guarded and clique guarded (relativized) semantics of fragments of first order logic using finitely many variables. Both positive and negative results are presented.     

The Square of Opposition and the Four Fundamental Choices

Each predicate of the Aristotelian square of opposition includes the word “is”. Through a twofold interpretation of this word the square includes both classical logic and non-classical logic. All theses embodied by the square of opposition are preserved by the new interpretation, except for contradictories, which are substituted by incommensurabilities. Indeed, the new interpretation of the square of opposition concerns the relationships among entire theories, each represented by means of a characteristic predicate. A generalization of the square of opposition is achieved by not adjoining, according to two Leibniz’ suggestions about human mind, one more choice about the kind of infinity; i.e., a choice which was unknown by Greek’s culture, but which played a decisive role for the birth and then the development of modern science. This essential innovation of modern scientific culture explains why in modern times the Aristotelian square of opposition was disregarded. This work was completed with the support of our -pert.     

On witnessed models in fuzzy logic II

First the expansion of the ?ukasiewicz (propositional and predicate) logic by the unary connectives of dividing by any natural number (Rational ?ukasiewicz logic) is studied; it is shown that in the predicate case the expansion is conservative w.r.t. witnessed standard 1‐tautologies. This result is used to prove that the set of witnessed standard 1‐tautologies of the predicate product logic is Π₂‐hard. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Monadic <Emphasis Type="Italic">GMV</Emphasis>-algebras

Monadic MV-algebras are an algebraic model of the predicate calculus of the Łukasiewicz infinite valued logic in which only a single individual variable occurs. GMV-algebras are a non-commutative generalization of MV-algebras and are an algebraic counterpart of the non-commutative Łukasiewicz infinite valued logic. We introduce monadic GMV-algebras and describe their connections to certain couples of GMV-algebras and to left adjoint mappings of canonical embeddings of GMV-algebras. Furthermore, functional MGMV-algebras are studied and polyadic GMV-algebras are introduced and discussed. The first author was supported by the Council of Czech Government, MSM 6198959214.     

Representation theorems for probability functions satisfying spectrum exchangeability in inductive logic

We prove de Finetti style representation theorems covering the class of all probability functions satisfying spectrum exchangeability in polyadic inductive logic and give an application by characterizing those probability functions satisfying spectrum exchangeability which can be extended to a language with equality whilst still satisfying that property.     

A construction of cylindric and polyadic algebras from atomic relation algebras

Given a simple atomic relation algebra ${\mathcal{A}}$ and a finite n ?? 3, we construct effectively an atomic n-dimensional polyadic equality-type algebra ${\mathcal{P}}$ such that for any subsignature L of the signature of ${\mathcal{P}}$ that contains the boolean operations and cylindrifications, the L-reduct of ${\mathcal{P}}$ is completely representable if and only if ${\mathcal{A}}$ is completely representable. If ${\mathcal{A}}$ is finite then so is ${\mathcal{P}}$ . It follows that there is no algorithm to determine whether a finite n-dimensional cylindric algebra, diagonal-free cylindric algebra, polyadic algebra, or polyadic equality algebra is representable (for diagonal-free algebras this was known). We also obtain a new proof that the classes of completely representable n-dimensional algebras of these types are non-elementary, a result that remains true for infinite dimensions if the diagonals are present, and also for infinite-dimensional diagonal-free cylindric algebras.     

Representation theorems for probability functions satisfying spectrum exchangeability in inductive logic

We prove de Finetti style representation theorems covering the class of all probability functions satisfying spectrum exchangeability in polyadic inductive logic and give an application by characterizing those probability functions satisfying spectrum exchangeability which can be extended to a language with equality whilst still satisfying that property.