We present an axiom system for basic hybrid logic extended with propositional quantifiers (a second-order extension of basic hybrid logic) and prove its (basic and pure) strong completeness with respect to general models.

The article concerns two axiom systems of Słupecki for the functionally complete three-valued propositional logic: W1–W6 and A1–A9. The article proves that both of them are inadequate—W1–W6 is semantically incomplete, on the other hand, A1–A9 governs a functionally incomplete calculus, and thus, it cannot be a semantically complete axiom system for the functionally complete three-valued logic.

Logical matrices for orthomodular logic are introduced. The underlying algebraic structures are orthomodular lattices, where the conditional connective is the Sasaki arrow. An axiomatic calculusOMC is proposed for the orthomodular-valid formulas.OMC is based on two primitive connectives — the conditional, and the falsity constant. Of the five axiom schemata and two rules, only one pertains to the falsity constant. Soundness is routine. Completeness is demonstrated using standard algebraic techniques. The Lindenbaum-Tarski algebra ofOMC is constructed, and it is shown to (...) be an orthomodular lattice whose unit element is the equivalence class of theses ofOMC. (shrink)

Using the axiom system provided by Carsten Augat in [1], it is shown that the only 6-variable statement among the axioms of the axiom system for plane hyperbolic geometry (in Tarski's language L B =), we had provided in [3], is superfluous. The resulting axiom system is the simplest possible one, in the sense that each axiom is a statement in prenex form about at most 5 points, and there is no axiom system consisting entirely (...) of at most 4-variable statements. (shrink)

J. D. Monk has shown that for first order languages with finitely many variables there is no finite set of schema which axiomatizes the universally valid formulas. There are such finite sets of schema which axiomatize the formulas valid in all structures of some fixed finite size.

Dependencies are identified in two recently proposed first-order axiom systems for plane hyperbolic geometry. Since the dependencies do not specifically concern hyperbolic geometry, our results yield two simpler axiom systems for absolute geometry.

Paul Hovda’s excellent paper ‘What Is Classical Mereology?' has fruitfully reshaped the debate concerning the axiomatic foundations of classical mereology. Precisely because of the importance of Hovda’s work and its usefulness as a reference tool, we note here that one of the five axiom systems presented therein, corresponding the ‘Third Way’ to classical mereology, is defective and must be amended. In addition, we note that two other axiom systems, corresponding to the ‘First Way’ and to the (...) ‘Fifth Way’, involve redundancies. (shrink)

We will study several weak axiom systems that use the Subtraction and Division primitives (rather than Addition and Multiplication) to formally encode the theorems of Arithmetic. Provided such axiom systems do not recognize Multiplication as a total function, we will show that it is feasible for them to verify their Semantic Tableaux, Herbrand, and Cut-Free consistencies. If our axiom systems additionally do not recognize Addition as a total function, they will be capable of recognizing (...) the consistency of their Hilbert-style deductive proofs. Our axiom systems will not be strong enough to recognize their Canonical Reflection principle, but they will be capable of recognizing an approximation of it, called the "Tangibility Reflection Principle". We will also prove some new versions of the Second Incompleteness Theorem stating essentially that it is not possible to extend our exceptions to the Incompleteness Theorem much further. (shrink)

We provide a quantifier-free axiom system for plane hyperbolic geometry in a language containing only absolute geometrically meaningful ternary operations (in the sense that they have the same interpretation in Euclidean geometry as well). Each axiom contains at most 4 variables. It is known that there is no axiom system for plane hyperbolic consisting of only prenex 3-variable axioms. Changing one of the axioms, one obtains an axiom system for plane Euclidean geometry, expressed in the same (...) language, all of whose axioms are also at most 4-variable universal sentences. We also provide an axiom system for plane hyperbolic geometry in Tarski's language L B which might be the simplest possible one in that language. (shrink)

This paper presents a calculus for mereotopological reasoning in which two-dimensional spatial regions are treated as primitive entities. A first order predicate language ℒ with a distinguished unary predicate c(x), function-symbols +, · and - and constants 0 and 1 is defined. An interpretation ℜ for ℒ is provided in which polygonal open subsets of the real plane serve as elements of the domain. Under this interpretation the predicate c(x) is read as 'region x is connected' and the function-symbols and (...) constants are given their meaning in terms of a Boolean algebra of polygons. We give an alternative interpretation ������ base on the real closed plane which turns out to be isomorphic to ℜ. A set of axioms and a rule of inference are introduced. We prove the soundness and completeness of the calculus with respect to the given interpretation. (shrink)

This paper deals with the axiomatizability problem for the matrix-based logics RMQ − and RMQ *. We present a Hilbert-style axiom system for RMQ −, and a quasi-axiomatization based on it for RMQ *. We further compare these logics to different well-known modal logics, and assess its status as relevance logics.

We introduce a notion of relative efficiency for axiom systems. Given an axiom system Aβ for a theory T consistent with S12, we show that the problem of deciding whether an axiom system Aα for the same theory is more efficient than Aβ is II2-hard. Several possibilities of speed-up of proofs are examined in relation to pairs of axiom systems Aα, Aβ, with Aα ⊇ Aβ, both in the case of Aα, Aβ having the (...) same language, and in the case of the language of Aα extending that of Aβ: in the latter case, letting Prα, Prβ denote the theories axiomatized by Aα, Aβ, respectively, and assuming Prα to be a conservative extension of Prβ, we show that if Aα — Aβ contains no nonlogical axioms, then Aα can only be a linear speed-up of Aβ; otherwise, given any recursive function g and any Aβ, there exists a finite extension Aα of Aβ such that Aα is a speed-up of Aβ with respect to g. (shrink)

This article will study a class of deduction systems that allow for a limited use of the modus ponens method of deduction. We will show that it is possible to devise axiom systems α that can recognize their consistency under a deduction system D provided that: (1) α treats multiplication as a 3-way relation (rather than as a total function), and that (2) D does not allow for the use of a modus ponens methodology above essentially the (...) levels of Π1 and Σ1 formulae. Part of what will make this boundary-case exception to the Second Incompleteness Theorem interesting is that we will also characterize generalizations of the Second Incompleteness Theorem that take force when we only slightly weaken the assumptions of our boundary-case exceptions in any of several further directions. (shrink)

A method of constructing Hilbert-type axiom systems for standard many-valued propositional logics was offered by Rosser and Turquette. Although this method is considered to be a solution of the problem of axiomatisability of a wide class of many-valued logics, the article demonstrates that it fails to produce adequate axiom systems. The article concerns finitely many-valued propositional logics of Łukasiewicz. It proves that if standard propositional connectives of the Rosser–Turquette axiom systems are definable in terms (...) of the propositional connectives of Łukasiewicz’s logics, and thus, they are normal ones, then every Rosser–Turquette axiom system for a finite-valued Łukasiewicz’s logic is semantically incomplete. (shrink)

We discuss in this paper the question of the scope of the principle of tolerance about languages promoted in Carnap's The Logical Syntax of Language and the nature of the analogy between it and the rudimentary conventionalism purportedly exhibited in the work of Poincaré and Hilbert. We take it more or less for granted that Poincaré and Hilbert do argue for conventionalism. We begin by sketching Coffa's historical account, which suggests that tolerance be interpreted as a conventionalism that allows us (...) complete freedom to select whatever language we wish—an interpretation that generalizes the conventionalism promoted by Poincaré and Hilbert which allows us complete freedom to select whatever axiom system we wish for geometry. We argue that such an interpretation saddles Carnap with a theory of meaning that has unhappy consequences, a theory we believe he did not hold. We suggest that the principle of linguistic tolerance in fact has a more limited scope; but within that scope the analogy between tolerance and geometric conventionalism is quite tight. (shrink)

The article explores the following question: which among the most often examined in the literature method of constructing Hilbert-type axiom systems for finite-valued propositional logics of Łukasi...