We prove the following preservation theorem for the Horn fragment of Equality-free Logic:Theorem 0.1. For any sentence σ ϵ L, the following are equivalent:i ) σ is preserved under Hs, Hs -1 and PR.i i ) σ is logically equivalent to an equality-free Horn sentence.

We prove some preservation theorems concerning inductive and model-complete theories in the framework of semi-classical logic introduced in [1].

We define and study a new restricted consistency notion RCon ∗ for bounded arithmetic theories T 2 j . It is the strongest ∀ Π 1 b -statement over S 2 1 provable in T 2 j , similar to Con in Krajíček and Pudlák, 29) or RCon in Krajı́ček and Takeuti 107). The advantage of our notion over the others is that RCon ∗ can directly be used to construct models of T 2 j . We apply this by (...) proving preservation theorems for theories of bounded arithmetic of the following well-known kind: The ∀ Π 1 b -separation of bounded arithmetic theories S 2 i from T 2 j is equivalent to the existence of a model of S 2 i which does not have a Δ 0 b -elementary extension to a model of T 2 j . More specific, let M ⊨ Ω 1 nst denote that there is a nonstandard element c in M such that the function n ↦ 2 log c is total in M . Let BLΣ 1 b be the bounded collection schema for Σ 1 b -formulas. We obtain the following preservation results: the ∀ Π 1 b -separation of S 2 i from T 2 j is equivalent to the existence of 1. a model of S 2 i +Ω 1 nst which is 1 b -closed w.r.t. T 2 j , 2. a countable model of S 2 i + BLΣ 1 b without weak end extensions to models of T 2 j. (shrink)

We present an exposition of much of Sections VI.3 and XVIII.3 from Shelah's book Proper and Improper Forcing. This covers numerous preservation theorems for countable support iterations of proper forcing, including preservation of the property “no new random reals over V ”, the property “reals of the ground model form a non-meager set”, the property “every dense open set contains a dense open set of the ground model”, and preservation theorems related to the weak bounding (...) property, the weak ωω -bounding property, and the property “the set of reals of the ground model has positive outer measure”. (shrink)

We show that the existential preservation theorem fails for two-variable first-order logic FO2. It is known that for all k ≥ 3, FOk does not have an existential preservation theorem, so this settles the last open case, answering a question of Andreka, van Benthem, and Németi. In contrast, we prove that the homomorphism preservation theorem holds for FO2.

We define notions of homomorphism, submodel, and sandwich of Kripke models, and we define two syntactic operators analogous to universal and existential closure. Then we prove an intuitionistic analogue of the generalized (dual of the) Lyndon-Łoś-Tarski Theorem, which characterizes the sentences preserved under inverse images of homomorphisms of Kripke models, an intuitionistic analogue of the generalized Łoś-Tarski Theorem, which characterizes the sentences preserved under submodels of Kripke models, and an intuitionistic analogue of the generalized Keisler Sandwich Theorem, which characterizes the (...) sentences preserved under sandwiches of Kripke models. We also define several intuitionistic formula hierarchies analogous to the classical formula hierarchies $\forall_n (= \Pi^0_n)$ and $\exists_n (=\Sigma^0_n)$ , and we show how our generalized syntactic preservation theorems specialize to these hierarchies. Each of these theorems implies the corresponding classical theorem in the case where the Kripke models force classical logic. (shrink)

There are several ways for defining the notion submodel for Kripke models of intuitionistic first‐order logic. In our approach a Kripke model A is a submodel of a Kripke model B if they have the same frame and for each two corresponding worlds Aα and Bα of them, Aα is a subset of Bα and forcing of atomic formulas with parameters in the smaller one, in A and B, are the same. In this case, B is called an extension of (...) A. We characterize theories that are preserved under taking submodels and also those that are preserved under taking extensions as universal and existential theories, respectively. We also study the notion elementary submodel defined in the same style and give some results concerning this notion. In particular, we prove that the relation between each two corresponding worlds of finite Kripke models A ≤ B is elementary extension (in the classical sense) (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

We present an exposition of Section VI.1 and most of Section VI.2 from Shelah’s book Proper and Improper Forcing. These sections offer proofs of the preservation under countable support iteration of proper forcing of various properties, including proofs that ωω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\omega^\omega}$$\end{document} -bounding, the Sacks property, the Laver property, and the P-point property are preserved by countable support iteration of proper forcing.

Many results concerning the equivalence between a syntactic form of formulas and a model theoretic conditions are proven directly without using any form of a continuum hypothesis. In particular, it is demonstrated that any reduced product sentence is equivalent to a Horn sentence. Moreover, in any first order language without equality one now has that a reduced product sentence is equivalent to a Horn sentence and any sentence is equivalent to a Boolean combination of Horn sentences.

Linear continuous logic is the fragment of continuous logic obtained by restricting connectives to addition and scalar multiplications. Most results in the full continuous logic have a counterpart in this fragment. In particular a linear form of the compactness theorem holds. We prove this variant and use it to deduce some basic preservation theorems.

In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each of these properties. These results provide simple proofs for some known results in the model theory of the bounded arithmetic theories like CPV and PV1. We use the mentioned results to obtain some independence results in the context of intuitionistic bounded arithmetic. We show that, if the intuitionistic theory of polynomial induction (...) on strict $\Pi_2^{b}$ formulas proves decidability of $\Sigma_1^b$ formulas, then P=NP. We also prove that, if the mentioned intuitionistic theory proves ${\rm LMIN}(\Sigma_{1}^{b})$ , then P=NP. (shrink)

We prove the NTP1 property of a geometric theory T is inherited by theories of lovely pairs and H‐structures associated to T. We also provide a class of examples of nonsimple geometric NTP1 theories.

A class of Kripke models is modally definable if there is a set of modal formulas such that the class consists exactly of models on which every formula from that set is globally true. In this paper, a class is also considered definable if there is a set of formulas such that it consists exactly of models in which every formula from that set is satisfiable. The notion of modal definability is then generalized by combining these two. For thus obtained (...) types of modal definability on the level of Kripke models, we give characterization theorems in the usual form, in terms of algebraic closure conditions. As some consequences of these, various preservation results are presented. Also, some characterizations are strengthened by replacing closure under ultraproducts with closure under ultrapowers. (shrink)

We characterize the model companions of universal Horn classes generated by a two-element algebra (or ordered two-element algebra). We begin by proving that given two mutually model consistent classes M and N of L (respectively L') structures, with $\mathscr{L} \subseteq \mathscr{L}'$ , M ec = N ec ∣ L , provided that an L-definability condition for the function and relation symbols of L' holds. We use this, together with Post's characterization of ISP(A), where A is a two-element algebra, to show (...) that the model companions of these classes essentially lie in the classes of posets and semilattices, or characteristic two groups and relatively complemented distributive lattices. (shrink)

In this work we give a complete answer as to the possible implications between some natural properties of Lebesgue measure and the Baire property. For this we prove general preservation theorems for forcing notions. Thus we answer a decade-old problem of J. Baumgartner and answer the last three open questions of the Kunen-Miller chart about measure and category. Explicitly, in \S1: (i) We prove that if we add a Laver real, then the old reals have outer measure one. (...) (ii) We prove a preservation theorem for countable-support forcing notions, and using this theorem we prove (iii) If we add ω 2 Laver reals, then the old reals have outer measure one. From this we obtain (iv) $\operatorname{Cons}(\mathrm{ZF}) \Rightarrow \operatorname{Cons}(\mathrm{ZFC} + \neg B(m) + \neg U(m) + U(c))$ . In \S2: (i) We prove a preservation theorem, for the finite support forcing notion, of the property " $F \subseteq ^\omega\omega$ is an unbounded family." (ii) We introduce a new forcing notion making the old reals a meager set but the old members of ω ω remain an unbounded family. Using this we prove (iii) $\operatorname{Cons}(\mathrm{ZF}) \Rightarrow \operatorname{Cons}(\mathrm{ZFC} + U(m) + \neg B(c) + \neg U(c) + C(c))$ . In \S3: (i) We prove a preservation theorem, for the finite support forcing notion, of a property which implies "the union of the old measure zero sets is not a measure zero set," and using this theorem we prove (ii) $\operatorname{Cons}(\mathrm{ZF}) \Rightarrow \operatorname{Cons}(\mathrm{ZFC} + \neg U(m) + C(m) + \neg C(c))$. (shrink)

In this paper we deal with infinitary universal Horn logic both with and without equality. First, we obtain a relative Lyndon-style interpolation theorem. Using this result, we prove a non-standard preservation theorem which contains, as a particular case, a Lyndon-style theorem on surjective homomorphisms in its Makkai-style formulation. Another consequence of the preservation theorem is a theorem on bimorphisms, which, in particular, provides a tool for immediate obtaining characterizations of infinitary universal Horn classes without equality from those with (...) equality. From the theorem on surjective homomorphisms we also derive a non-standard Beth-style preservation theorem that yields a non-standard Beth-style definability theorem, according to which implicit definability of a relation symbol in an infinitary universal Horn theory implies its explicit definability by a conjunction of atomic formulas. We also apply our theorem on surjective homomorphisms, theorem on bimorphisms and definability theorem to algebraic logic for general propositional logic. (shrink)

I prove several natural preservation theorems for the countable support iteration. This solves a question of Rosłanowski regarding the preservation of localization properties and greatly simplifies the proofs in the area.

There are several three-valued logical systems that form a scattered landscape, even if all reasonable connectives in three-valued logics can be derived from a few of them. Most papers on this subject neglect the issue of the relevance of such logics in relation with the intended meaning of the third truth-value. Here, we focus on the case where the third truth-value means unknown, as suggested by Kleene. Under such an understanding, we show that any truth-qualified formula in a large range (...) of three-valued logics can be translated into KD as a modal formula of depth 1, with modalities in front of literals only, while preserving all tautologies and inference rules of the original three-valued logic. This simple information logic is a two-tiered classical propositional logic with simple semantics in terms of epistemic states understood as subsets of classical interpretations. We study in particular the translations of Kleene, Gödel, ᴌukasiewicz and Nelson logics. We show that Priest’s logic of paradox, closely connected to Kleene’s, can also be translated into our modal setting, simply by exchanging the modalities possible and necessary. Our work enables the precise expressive power of three-valued logics to be laid bare for the purpose of uncertainty management. (shrink)

We prove the preservation theorems for NATP; many of them extend the previously established preservation results for other model-theoretic tree properties. Using them, we also furnish proper examples of NATP theories which are simultaneously TP2 and SOP. First, we show that NATP is preserved by the parametrization and sum of the theories of Fraïssé limits of Fraïssé classes satisfying strong amalgamation property. Second, the preservation of NATP for two kinds of dense/co-dense expansions, i.e. the theories of (...) lovely pairs and of [Formula: see text]-structures for geometric theories, and dense/co-dense expansion on vector spaces is proved. Next, we prove the preservation of NATP for the generic predicate expansion and the pair of an algebraically closed field and its distinguished subfield; for the latter, not only NATP, but also the preservation of NTP1 and NTP2 is considered. Finally, we present some proper examples of NATP theories using the results proved in this paper, including the parametrization of DLO and the expansion of an algebraically closed field by adding a generic linear order. In particular, we show that the model companion of the theory of algebraically closed fields with circular orders (ACFO) is NATP. (shrink)

In this paper we mainly study preservation theorems for two fragments of the infinitary languagesLκκ, withκregular, without the equality symbol: the universal Horn fragment and the universal strict Horn fragment. In particular, whenκisω, we obtain the corresponding theorems for the first-order case.The universal Horn fragment of first-order logic (with equality) has been extensively studied; for references see [10], [7] and [8]. But the universal Horn fragment without equality, used frequently in logic programming, has received much less attention (...) from the model theoretic point of view. At least to our knowledge, the problem of obtaining preservation results for it has not been studied before by model theorists. In spite of this, in the field of abstract algebraic logic we find a theorem which, properly translated, is a preservation result for the strict universal Horn fragment of infinitary languages without equality which, apart from function symbols, have only a unary relation symbol. This theorem is due to J. Czelakowski; see [5], Theorem 6.1, and [6], Theorem 5.1. A. Torrens [12] also has an unpublished result dealing with matrices of sequent calculi which, properly translated, is a preservation result for the strict universal Horn fragment of a first-order language. And in [2] of W. J. Blok and D. Pigozzi we find Corollary 6.3 which properly translated corresponds to our Corollary 19, but for the case of a first-order language that apart from its function symbols has only oneκ-ary relation symbol, and for strict universal Horn sentences. The study of these results is the basis for the present work. In the last part of the paper, Section 4, we will make these connections clear and obtain some of these results from our theorems. In this way we hope to make clear two things: (1) The field of abstract algebraic logic can be seen, in part, as a disguised study of universal Horn logic without equality and so has an added interest. (2) A general study of universal Horn logic without equality from a model theoretic point of view can be of help in the field of abstract algebraic logic. (shrink)

The revisionary approach to semantic paradox is commonly thought to have a somewhat uncomfortable corollary, viz. that, on pain of triviality, we cannot affirm that all valid arguments preserve truth (Beall2007, Beall2009, Field2008, Field2009). We show that the standard arguments for this conclusion all break down once (i) the structural rule of contraction is restricted and (ii) how the premises can be aggregated---so that they can be said to jointly entail a given conclusion---is appropriately understood. In addition, we briefly rehearse (...) some reasons for restricting structural contraction. (shrink)

The article approaches cut elimination from a new angle. On the basis of an arbitrary inference relation among logically atomic formulae, an inference relation on a language possessing logical operators is defined by means of inductive clauses similar to the operator-introducing rules of a cut-free intuitionistic sequent calculus. The logical terminology of the richer language is not uniquely specified, but assumed to satisfy certain conditions of a general nature, allowing for, but not requiring, the existence of infinite conjunctions and disjunctions. (...) We investigate to what extent structural properties of the given atomic relation are preserved through the extension to the full language. While closure under the Cut rule narrowly construed is not in general thus preserved, two properties jointly amounting to closure under the ordinary structural rules, including Cut, are. -/- Attention is then narrowed down to the special case of a standard first-order language, where a similar result is obtained also for closure under substitution of terms for individual parameters. Taken together, the three preservation results imply the familiar cut-elimination theorem for pure first-order intuitionistic sequent calculus. -/- In the interest of conceptual economy, all deducibility relations are specified purely inductively, rather than in terms of the existence of formal proofs of any kind. (shrink)

Following a result by De Rijke for modal logic, it is shown that the basic weak entailment model-theoretic language with absurdity is the maximal model-theoretic language having the finite occurrence property, preservation under relevant directed bisimulations and the finite depth property. This can be seen as a generalized preservation theorem characterizing propositional weak entailment formulas among formulas of other model-theoretic languages.

This note exploits back-and-forth characteristics to construct, using a single method, short proofs for ten classics of first-order and modal logic: interpolation theorems, preservation theorems, and Lindström's theorem.

A completeness theorem is established for logics with congruence endowed with general semantics (in the style of general frames). As a corollary, completeness is shown to be preserved by fibring logics with congruence provided that congruence is retained in the resulting logic. The class of logics with equivalence is shown to be closed under fibring and to be included in the class of logics with congruence. Thus, completeness is shown to be preserved by fibring logics with equivalence and general semantics. (...) An example is provided showing that completeness is not always preserved by fibring ligics endowed with standard (non general) semantics. A categorial characterization of fibring is provided using coproducts and cocartesian liftings. (shrink)

Uniform proofs systems have recently been proposed [Mi191j as a proof-theoretic foundation and generalization of logic programming. In [Mom92a] an extension with constructive negation is presented preserving the nature of abstract logic programming language. Here we adapt this approach to provide a complete theorem proving technique for minimal, intuitionistic and classical logic, which is totally goal-oriented and does not require any form of ancestry resolution. The key idea is to use the Godel-Gentzen translation to embed those logics in the syntax (...) of Hereditary Harrop formulae, for which uniform proofs are complete. We discuss some preliminary implementation issues. (shrink)

The Gap Forcing Theorem, a key contribution of this paper, implies essentially that after any reverse Easton iteration of closed forcing, such as the Laver preparation, every supercompactness measure on a supercompact cardinal extends a measure from the ground model. Thus, such forcing can create no new supercompact cardinals, and, if the GCH holds, neither can it increase the degree of supercompactness of any cardinal; in particular, it can create no new measurable cardinals. In a crescendo of what I call (...) exact preservation theorems, I use this new technology to perform a kind of partial Laver preparation, and thereby finely control the class of posets which preserve a supercompact cardinal. Eventually, I prove the ‘As You Like It’ Theorem, which asserts that the class of κ -directed closed posets which preserve a supercompact cardinal κ can be made by forcing to conform with any pre-selected local definition which respects the equivalence of forcing. Along the way I separate completely the levels of the superdestructibility hierarchy, and, in an epilogue, prove that the notions of fragility and superdestructibility are orthogonal — all four combinations are possible. (shrink)

Let C be a small Barr-exact category, Reg the category of all regular functors from C to the category of small sets. A form of M. Barr's full embedding theorem states that the evaluation functor e : C →[Reg, Set ] is full and faithful. We prove that the essential image of e consists of the functors that preserve all small products and filtered colimits. The concept of κ-Barr-exact category is introduced, for κ any infinite regular cardinal, and the natural (...) generalization to κ-Barr-exact categories of the above result is proved. The treatment combines methods of model theory and category theory. Some applications to module categories are given. (shrink)

In [This Zeitschrift 25 , 45-52, 119-134, 447-464], Pavelka systematically discussed propositional calculi with values in enriched residuated lattices and developed a general framework for approximate reasoning. In the first part of this paper we introduce the concept of generalized quantifiers into Pavelka's logic and establish the fundamental theorem of ultraproduct in first order Pavelka's logic with generalized quantifiers. In the second part of this paper we show that the fundamental theorem of ultraproduct in first order Pavelka's logic is preserved (...) under some direct product of lattices of truth values. (shrink)

We prove that the minimal Logic of Formal Inconsistency $\mathsf{QmbC}$ validates a weaker version of Fraïssé’s theorem. LFIs are paraconsistent logics that relativize the Principle of Explosion only to consistent formulas. Now, despite the recent interest in LFIs, their model-theoretic properties are still not fully understood. Our aim in this paper is to investigate the situation. Our interest in FT has to do with its fruitfulness; the preservation of FT indicates that a number of other classical semantic properties can (...) be also salvaged in LFIs. Further, given that FT depends on truth-functionality, whether full FT holds for $\mathsf{QmbC}$ becomes a challenging question. (shrink)

The CPT theorem states that any causal, Lorentz-invariant, thermodynamically well-behaved quantum field theory must also be invariant under a reflection symmetry that reverses the direction of time, flips spatial parity, and conjugates charge. Although its physical basis remains obscure, CPT symmetry appears to be necessary in order to unify quantum mechanics with relativity. This paper attempts to decipher the physical reasoning behind proofs of the CPT theorem in algebraic quantum field theory. Ultimately, CPT symmetry is linked to a systematic reversal (...) of the C*-algebraic Lie product that encodes the generating relationship between observables and symmetries. In any physically reasonable relativistic quantum field theory it is always possible to systematically reverse this generating relationship while preserving the dynamics, spectra, and localization properties of physical systems. Rather than the product of three separate reflections, CPT symmetry is revealed to be a single global reflection of the theory’s state space. (shrink)

In a recent pair of publications, Richard Bradley has offered two novel no-go theorems involving the principle of Preservation for conditionals, which guarantees that one’s prior conditional beliefs will exhibit a certain degree of inertia in the face of a change in one’s non-conditional beliefs. We first note that Bradley’s original discussions of these results—in which he finds motivation for rejecting Preservation, first in a principle of Commutativity, then in a doxastic analogue of the rule of modus (...) ponens —are problematic in a significant number of respects. We then turn to a recent U-turn on his part, in which he winds up rescinding his commitment to modus ponens, on the grounds of a tension with the rule of Import-Export for conditionals. Here we offer an important positive contribution to the literature, settling the following crucial question that Bradley leaves unanswered: assuming that one gives up on full-blown modus ponens on the grounds of its incompatibility with Import-Export, what weakened version of the principle should one be settling for instead? Our discussion of the issue turns out to unearth an interesting connection between epistemic undermining and the apparent failures of modus ponens in McGee’s famous counterexamples. (shrink)

In this article, we investigate the status of the homomorphism preservation property amongst restricted classes of finite relational structures and algebraic structures. We show that there are many homomorphism-closed classes of finite lattices that are definable by a first-order sentence but not by existential positive sentences, demonstrating the failure of the homomorphism preservation property for lattices at the finite level. In contrast to the negative results for algebras, we establish a finite-level relativised homomorphism preservation theorem in the (...) relational case. More specifically, we give a complete finite-level characterisation of first-order definable finitely generated anti-varieties relative to classes of relational structures definable by sentences of some general forms. When relativisation is dropped, this gives a fresh proof of Atserias’s characterisation of first-order definable constraint satisfaction problems over a fixed template, a well known special case of Rossman’s Finite Homomorphism Preservation Theorem. (shrink)

Metalogic is an open-ended cognitive, formal methodology pertaining to semantics and information processing. The language that mathematizes metalogic is known as metalanguage and deals with metafunctions purely by extension on patterns. A metalogical process involves an effective enrichment in knowledge as logical statements, and, since human cognition is an inherently logic–based representation of knowledge, a metalogical process will always be aimed at developing the scope of cognition by exploring possible cognitive implications reflected on successive levels of abstraction. Indeed, it is (...) basically impracticable to maintain logic–and–metalogic without paying heed to cognitive theorizing. For it is cognitively irrelevant whether possible conclusions are deduced from some premises before the premises are determined to be true or whether the premises themselves are determined to be true first and, then, the conclusions are deduced from them. In this paper we consider the term metalogic as inherently embodied under the framework referred to as cognitive science and mathematics. We propose a metalogical interpretation of Arrow’s impossibility theorem and, to that end, choice theory is understood as a mental course of action dealing with logic and metalogic issues, in which a possible mathematical approach to model a mental course of action is adopted as a systematic operating method. Nevertheless, if we look closely at the core of Arrow’s impossibility theorem in terms of metalogic, a second fundamental contribution to this framework is represented by the Nash equilibrium. As a result of the foregoing, therefore, we prove the metalogical equivalence between Arrow’s impossibility theorem and the existence of the Nash equilibrium. More specifically, Arrow’s requirements correspond to the Nash equilibrium for finite mixed strategies with no symmetry conditions. To demonstrate this proof, we first verify that Arrow’s set and Nash’s set are isomorphic to each other, both sets being under stated conditions of non–symmetry. Then, the proof is completed by virtue of category theory. Indeed, the two sets are categories that correspond biuniquely to one another and, thus, it is possible to define a covariant functor that preserves their mutual structures. According to this, we show the proof–dedicated metalanguage as a precursor to a special equivalence theorem. (shrink)

In this paper we first give a variant of a theorem of Jockusch–Lewis– Remmel on existence of a computable, degree-preserving homeomorphism between a bounded strong ${\Pi^0_2}$ class and a bounded ${\Pi^0_1}$ class in 2 ω . Namely, we show that for mathematically common and interesting topological spaces, such as computably presented ${\mathbb{R}^n}$ , we can obtain a similar result where the homeomorphism is in fact the identity mapping. Second, we apply this finding to give a new, priority-free proof of existence (...) of a tree of shadow points computable in 0′. (shrink)