We prove that all finitely axiomatizable tense logics with temporal operators for ‘always in the future’ and ‘always in the past’ and determined by linear fows time are coNP-complete. It follows, for example, that all tense logics containing a density axiom of the form ■n+1F p → nF p, for some n ≥ 0, are coNP-complete. Additionally, we prove coNP-completeness of all ∩-irreducible tense logics. As these classes of tense logics contain many Kripke incomplete bimodal logics, we obtain many natural (...) examples of Kripke incomplete normal bimodal logics which are nevertheless coNP-complete. (shrink)

This paper proves the finite axiomatizability of transitive modal logics of finite depth and finite width w.r.t. proper-successor-equivalence. The frame condition of the latter requires, in a rooted transitive frame, a finite upper bound of cardinality for antichains of points with different sets of proper successors. The result generalizes Rybakov’s result of the finite axiomatizability of extensions of$\mathbf {S4}$of finite depth and finite width.

We use the apparatus of the canonical formulas introduced by Zakharyaschev [10] to prove that all finitely axiomatizable normal modal logics containing K4.3 are decidable, though possibly not characterized by classes of finite frames. Our method is purely frame-theoretic. Roughly, given a normal logic L above K4.3, we enumerate effectively a class of frames with respect to which L is complete, show how to check effectively whether a frame in the class validates a given formula, and then apply a (...) Harropstyle argument to establish the decidability of L, provided of course that it has finitely many axioms. (shrink)

Finitely axiomatizable ℵ 1 categorical theories are locally modular.

We show that if G is a strongly minimal finitely axiomatizable group, the division ring of quasi-endomorphisms of G must be an infinite finitely presented ring.

This paper provides a mathematical model of scientific discovery. It is shown in the context of this model that any discovery problem that can be solved by a computable scientist can be solved by a computable scientist all of whose conjectures are finitely axiomatizable theories.

This paper focuses on order-preserving logics defined from varieties of distributive lattices with negation, and in particular on the problem of whether these can be axiomatized by means Hilbert-style calculi that are finite. On the negative side, we provide a syntactic condition on the equational presentation of a variety that entails failure of finite axiomatizability for the corresponding logic. An application of this result is that the logic of all distributive lattices with negation is not finitely axiomatizable; (...) we likewise establish that the order-preserving logic of the variety of all Ockham algebras is also not finitely axiomatizable. On the positive side, we show that an arbitrary subvariety of semi-De Morgan algebras is axiomatized by a finite number of equations if and only if the corresponding order-preserving logic is axiomatized by a finite Hilbert-style calculus. This equivalence also holds for every subvariety of a Berman variety of Ockham algebras. We obtain, as a corollary, a new proof that the implication-free fragment of intuitionistic logic is finitely axiomatizable, as well as a new corresponding Hilbert-style calculus. Our proofs are constructive in that they allow us to effectively convert an equational presentation of a variety of algebras into a Hilbert-style calculus for the corresponding order-preserving logic, and vice versa. We also consider the assertional logics associated to the above-mentioned varieties, showing in particular that the assertional logics of finitely axiomatizable subvarieties of semi-De Morgan algebras are finitely axiomatizable as well. (shrink)

We classify every finitely axiomatizable theory in infinite-valued propositional Łukasiewicz logic by an abstract simplicial complex equipped with a weight function . Using the Włodarczyk–Morelli solution of the weak Oda conjecture for toric varieties, we then construct a Turing computable one–one correspondence between equivalence classes of weighted abstract simplicial complexes, and equivalence classes of finitely axiomatizable theories, two theories being equivalent if their Lindenbaum algebras are isomorphic. We discuss the relationship between our classification and Markov’s undecidability theorem for PL-homeomorphism of (...) rational polyhedra. (shrink)

In this paper we investigate those extensions of the bimodal provability logic ${\vec CSM}_{0}$ (alias ${\vec PRL}_{1}$ or ${\vec F}^{-})$ which are subframe logics, i.e. whose general frames are closed under a certain type of substructures. Most bimodal provability logics are in this class. The main result states that all finitely axiomatizable subframe logics containing ${\vec CSM}_{0}$ are decidable. We note that, as a rule, interesting systems in this class do not have the finite model property and are not (...) even complete with respect to Kripke semantics. (shrink)

Let ℱ be the class of complete, finitely axiomatizable ω-categorical theories. It is not known whether there are simple theories in ℱ. We prove three results of the form: if T∈ ℱ has a sufficently well-behaved definable set J, then T is not simple. All of our arguments assume that the definable set J satisfies the Mazoyer hypothesis, which controls how an element of J can be algebraic over a subset of the model. For every known example in ℱ, there (...) is a definable set satisfying the Mazoyer hypothesis. (shrink)

Mereology is the theory of the relation “being a part of”. The first exact formulation of mereology is due to the Polish logician Stanisław Leśniewski. But Leśniewski’s mereology is not first-order axiomatizable, for it requires every subset of the domain to have a fusion. In recent literature, a first-order theory named General Extensional Mereology can be thought of as a first-order approximation of Leśniewski’s theory, in the sense that GEM guarantees that every definable subset of the domain has a fusion, (...) and this has been achieved by positing an axiom schema which in effect defines infinitely many axioms. Intuitively, in order to range over every definable subset, such an axiom schema seems unavoidable. But this paper will show that GEM is finitely axiomatizable and that all we need are just finitely many instances of the said axiom schema. (shrink)

Every ℵ 0 -categorical partially ordered set of finite width has a finitely axiomatizable theory. Every ℵ 0 -categorical partially ordered set of finite weak width has a decidable theory. This last statement constitutes a major portion of the complete (with three exceptions) characterization of those finite partially ordered sets for which any ℵ 0 -categorical partially ordered set not embedding one of them has a decidable theory.

In this paper we investigate those extensions of the bimodal provability logic \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\vec CSM}_{0}$\end{document} (alias \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\vec PRL}_{1}$\end{document} or \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\vec F}^{-})$\end{document} which are subframe logics, i.e. whose general frames are closed under a certain type of substructures. Most bimodal provability logics are in this class. The main result states that all finitely (...) axiomatizable subframe logics containing \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\vec CSM}_{0}$\end{document} are decidable. We note that, as a rule, interesting systems in this class do not have the finite model property and are not even complete with respect to Kripke semantics. (shrink)

The question of whether the bounded arithmetic theories and are equal is closely connected to the complexity question of whether is equal to. In this paper, we examine the still open question of whether the prenex version of,, is equal to. We give new dependent choice‐based axiomatizations of the ‐consequences of and. Our dependent choice axiomatizations give new normal forms for the ‐consequences of and. We use these axiomatizations to give an alternative proof of the finite axiomatizability of (...) and to show new results such as is finitely axiomatized and that there is a finitely axiomatized theory,, containing and contained in. On the other hand, we show that our theory for splits into a natural infinite hierarchy of theories. We give a diagonalization result that stems from our attempts to separate the hierarchy for. (shrink)

This paper, which in its subject matter goes back to works on strongly nite logics , is concerned with the following problems: Let Cn1; Cn2 be two strongly nite logics over the same propositional language. Is the supremum of Cn1 and Cn2 also a strongly nite operation? Is any nite matrix axiomatizable by a nite set of standard rules? The rst question can be found in [9] . The second conjec- ture was formulated by Wolfgang Rautenberg, but investigations into this (...) problem had been carried out earlier in works of many logicians . Moreover, Stephen Bloom [1] posed a conjecture stronger than that: the consequence de- termined by a nite matrix is nitely based, i.e. it is the consequence generated by a nite set of standard rules. This hypothesis was, however, disproved by Andrzej Wronski [10] . In the present paper it is shown that neither nor holds true. The negative answer to can be viewed as a generalization of the result given by Andrzej Wronski [10]. (shrink)

In the article [2] a hierarchy of modal logics has been defined to capture the logical features of Bayesian belief revision. Elements in that hierarchy were distinguished by the cardinality of the set of elementary propositions. By linking the modal logics in the hierarchy to the modal logics of Medvedev frames it has been shown that the modal logic of Bayesian belief revision determined by probabilities on a finite set of elementary propositions is not finitely axiomatizable. However, the infinite (...) case remained open. In this article we prove that the modal logic of Bayesian belief revision determined by standard Borel spaces is also not finitely axiomatizable. (shrink)

Modifying the methods of Z. Adamowicz's paper Herbrand consistency and bounded arithmetic [3] we show that there exists a number n such that ⋃m Sm (the union of the bounded arithmetic theories Sm) does not prove the Herbrand consistency of the finitely axiomatizable theory $S_{3}^{n}$.

We consider modal logics whose intermediate fragments lie between the logic of infinite problems [20] and the Medvedev logic of finite problems [15]. There is continuum of such logics [19]. We prove that none of them is finitely axiomatizable. The proof is based on methods from [12] and makes use of some graph-theoretic constructions (operations on coverings, and colourings).

We prove that every normal extension of the bi-modal system S52 is finitely axiomatizable and that every proper normal extension has NP-complete satisfiability problem.

It is well‐known that the theory of algebraically closed fields is not finitely axiomatizable. In this note, we prove that the theory of integrally closed integral domains is also not finitely axiomatizable.

In [4], I proved that the product-free fragment L of Lambek's syntactic calculus (cf. Lambek [2]) is not finitely axiomatizable if the only rule of inference admitted is Lambek's cut-rule. The proof (which is rather complicated and roundabout) was subsequently adapted by Kandulski [1] to the non-associative variant NL of L (cf. Lambek [3]). It turns out, however, that there exists an extremely simple method of non-finite-axiomatizability proofs which works uniformly for different subsystems of L (in particular, for (...) NL). We present it below to the use of those who refer to the results of [1] and [4]. (shrink)

We prove that every normal extension of the bi-modal system S52 is finitely axiomatizable and that every proper normal extension has NP-complete satisfiability problem.

Clark and Krauss [1977] presents a classification of complete, satisfiable and o-categorical theories in first order languages with finite non-logical vocabularies. In 1988 the first author modified this classification and raised three questions about the distribution of finitely axiomatizable theories. This paper answers two of those questions.

An example of finite tree Mo is presented such that its predicate logic (i.e. the intermediate predicate logic characterized by the class of all predicate Kripke frames based on Mo) is not finitely axiomatizable. Hence it is shown that the predicate analogue of de Jongh - McKay - Hosoi's theorem on the finite axiomatizability of every finite intermediate propositional logic is not true.

We define a property for varieties V, the f.r.p. . If it applies to a finitely based V then V is strongly finitely based in the sense of [14], see Theorem 2. Moreover, we obtain finite axiomatizability results for certain propositional logics associated with V, in its generality comparable to well-known finite base results from equational logic. Theorem 3 states that each variety generated by a 2-element algebra has the f.r.p. Essentially this implies finite axiomatizability (...) of a 2-valued logic in any finite language. (shrink)