In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called \emph{elementary}. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called \emph{canonical}. This is a survey of a recent and ongoing study of the class of elementary and canonical (...) modal formulae. We summarize main ideas and results, and outline further research perspectives. (shrink)

We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we (...) prove that all inductive formulae are elementary canonical and thus extend Sahlqvist’s theorem over them. In particular, we give a simple example of an inductive formula which is not frame-equivalent to any Sahlqvist formula. Then, after a deeper analysis of the inductive formulae as set-theoretic operators in descriptive and Kripke frames, we establish a somewhat stronger model-theoretic characterization of these formulae in terms of a suitable equivalence to syntactically simpler formulae in the extension of the language with reversive modalities. Lastly, we study and characterize the elementary canonical formulae in reversive languages with nominals, where the relevant notion of persistence is with respect to discrete frames. (shrink)

In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called elementary. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called canonical. This is a survey of a recent and ongoing study of the class of elementary and canonical (...) modal formulae. We summarize main ideas and results, and outline further research perspectives. (shrink)

We introduce partial Esakia morphisms, well partial Esakia morphisms, and strong partial Esakia morphisms between Esakia spaces and show that they provide the dual description of (∧, →) homomorphisms, (∧, →, 0) homomorphisms, and (∧, →, ∨) homomorphisms between Heyting algebras, thus establishing a generalization of Esakia duality. This yields an algebraic characterization of Zakharyaschev’s subreductions, cofinal subreductions, dense subreductions, and the closed domain condition. As a consequence, we obtain a new simplified proof (which is algebraic in nature) of Zakharyaschev’s (...) theorem that each intermediate logic can be axiomatized by canonical formulas. (shrink)

We introduce and study some variants of a notion of canonical set theoretical truth. By this, we mean truth in a transitive proper class model M of ZFC that is uniquely characterized by some $$\in$$ ∈ -formula. We show that there are interesting statements that hold in all such models, but do not follow from ZFC, such as the ground model axiom and the nonexistence of measurable cardinals. We also study a related concept in which we only require M (...) to be fixed up to elementary equivalence. We show that this theory-canonicity also goes beyond provability in ZFC, but it does not rule out measurable cardinals and it does not fix the size of the continuum. (shrink)

We study a canonical modal logic introduced by Lemmon, and axiomatised by an infinite sequence of axioms generalising McKinsey’s formula. We prove that the class of all frames for this logic is not closed under elementary equivalence, and so is non-elementary. We also show that any axiomatisation of the logic involves infinitely many non-canonical formulas.

For each intermediate propositional logicJ, J * denotes the least predicate extension ofJ. By the method of canonical models, the strongly Kripke completeness ofJ *+D(=x(p(x)q)xp(x)q) is shown in some cases including:1. J is tabular, 2. J is a subframe logic. A variant of Zakharyashchev's canonical formulas for intermediate logics is introduced to prove the second case.

In this paper we consider the normal modal logics of elementary classes defined by first-order formulas of the form \. We prove that many properties of these logics, such as finite axiomatisability, elementarity, axiomatisability by a set of canonical formulas or by a single generalised Sahlqvist formula, together with modal definability of the initial formula, either simultaneously hold or simultaneously do not hold.

This book is an introduction to elementary logic (classical propositional and first-order logic), comprising brief summaries of the basics of elementary logic, with the emphasis on typical questions and procedure descriptions and with a large number of corresponding exercises and problems. Solutions are given for each problem and exercise, often with commentaries. The first part, Basics of Logic, deals with (a) formal language, models, Venn diagrams for sentences, and translation from natural into formal language and vice versa, (b) (...) deduction and refutation methods in the format of natural deduction (Fitch and Suppes-Lemmon styles), tableau system and Venn diagrams, and (c) basic logical properties and relations (consistency, validity, consequence, equivalence, various types of opposition, logical completeness and independency, relationship between syntax and semantics). The second part, Logic in Understanding and Analysis, introduces into (a) logical approach to problem solving in concrete situations and events as presented in brief tales and anecdotes, (b) discovering the meaning, and reconstruction of logical interconnections, in ordinary, scholarly and philosophical texts, (c) application of already mastered logical tools in examining and defining further theoretical (logical, scientific) concepts and in building formal languages. The shorter third part, From the Traditional Logic, is dedicated to the traditional logic of concepts, judgements and syllogisms, largely with the use of Venn diagrams. (shrink)

The Modal Predicate Calculus gives rise to issues surrounding the Barcan formulas, their converses, and necessary existence. I examine these issues by means of the Quantified Argument Calculus, a recently developed, powerful formal logic system. Quarc is closer in syntax and logical properties to Natural Language than is the Predicate Calculus, a fact that lends additional interest to this examination, as Quarc might offer a better representation of our modal concepts. The validity of the Barcan formulas and their converses is (...) shown by Quarc to be a result of the specific incorporation of quantification in the Predicate Calculus, and not as reflecting a feature of the interaction of quantification and modality more generally. Necessary existence is shown to follow from the identification, in the Predicate Calculus on its canonical interpretation, of particular quantification, ascription of existence and the ‘there is’ construction, three constructions which are distinguished in both Quarc and Natural Language. The issues surrounding the Barcan formulas, their converses and necessary existence are thus shown to be an artefact of a specific logic system, not an essential feature of our relevant modal concepts or of formal logic. (shrink)

Lyndon's Interpolation Theorem asserts that for any valid implication between two purely relational sentences of first-order logic, there is an interpolant in which each relation symbol appears positively (negatively) only if it appears positively (negatively) in both the antecedent and the succedent of the given implication. We prove a similar, more general interpolation result with the additional requirement that, for some fixed tuple U of unary predicates U, all formulae under consideration have all quantifiers explicitly relativised to one of (...) the U. Under this stipulation, existential (universal) quantification over U contributes a positive (negative) occurrence of U. It is shown how this single new interpolation theorem, obtained by a canonical and rather elementary model theoretic proof, unifies a number of related results: the classical characterisation theorems concerning extensions (substructures) with those concerning monotonicity, as well as a many-sorted interpolation theorem focusing on positive vs. negative occurrences of predicates and on existentially vs. universally quantified sorts. (shrink)

We generalize the incompleteness proof of the modal predicate logic Q-S4+ p p + BF described in Hughes-Cresswell [6]. As a corollary, we show that, for every subframe logic Lcontaining S4, Kripke completeness of Q-L+ BF implies the finite embedding property of L.

Local connectedness functions for (κ, 1)-simplified morasses, localisations of the coupling function c studied in [M96, §1], are defined and their elementary properties discussed. Several different, useful, canonical ways of arriving at the functions are examined. This analysis is then used to give explicit formulae for generalisations of the local distance functions which were defined recursively in [K00], leading to simple proofs of the principal properties of those functions. It is then extended to the properties of local (...) connectedness functions in the context of κ-M-proper forcing for sucessor κ. The functions are shown to enjoy substantial strengthenings of the properties (particularly the ∆-properties) hitherto proved for both c and for Todorcevic’s ρ-functions in the special case κ = ω1. A couple of examples of the use of local connectedness functions in consort with κ-M-proper forcing are then given. (shrink)

We define intuitionistic subatomic natural deduction systems for reasoning with elementary would-counterfactuals and causal since-subordinator sentences. The former kind of sentence is analysed in terms of counterfactual implication, the latter in terms of factual implication. Derivations in these modal proof systems make use of modes of assumptions which are sensitive to the factuality status of the formula that is to be assumed. This status is determined by means of the reference proof system on top of which a modal proof (...) system is defined. The introduction and elimination rules for counterfactual (resp. factual) implication draw on this status. It is shown that derivations in the systems normalize and that normal derivations have the subexpression/subformula property. An intuitionistically acceptable proof-theoretic semantics is formulated in terms of canonical derivations. The systems are applied to so-called counterpossibles and to related constructions. (shrink)

An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of Gentzen-type systems which in addition to the standard axioms and structural rules have only logical rules in which exactly one occurrence of a quantifier is introduced. The semantics for these systems is provided using two-valued non-deterministic matrices, a generalization of the classical matrix. In this paper we use a constructive syntactic criterion of (...) coherence to characterize strong cutelimination in such systems. We show that the following properties of a canonical system G with arbitrary (n, k)-ary quantifiers are equivalent: (i) G is coherent, (ii) G admits strong cut-elimination, and (iii) G has a strongly characteristic two-valued generalized non-deterministic matrix. (shrink)

In this paper, we introduce a logic based on team semantics, called $\mathbf {FOT} $, whose expressive power is elementary, i.e., coincides with first-order logic both on the level of sentences and (possibly open) formulas, and we also show that a sublogic of $\mathbf {FOT} $, called $\mathbf {FOT}^{\downarrow } $, captures exactly downward closed elementary (or first-order) team properties. We axiomatize completely the logic $\mathbf {FOT} $, and also extend the known partial axiomatization of dependence logic to (...) dependence logic enriched with the logical constants in $\mathbf {FOT}^{\downarrow } $. (shrink)

The paper introduces a semantics for the language of propositional additive-multiplicative linear logic. It understands formulas as tasks that are to be accomplished by an agent (machine, robot) working as a slave for its master (user, environment). This semantics can claim to be a formalization of the resource philosophy associated with linear logic when resources are understood as agents accomplishing tasks. I axiomatically define a decidable logic TSKp and prove its soundness and completeness with respect to the task semantics in (...) the following intuitive sense: iff can be accomplished by an agent who has nothing but its intelligence (that is, no physical resources or external sources of information) for accomplishing tasks. (shrink)

A theoretical analysis of the concept of lifetime and mean life of unstable elementary particles is presented. New analytic formulas for lifetime and mean life as a function of decay width Γ and the mass of unstable particle are derived for Breit-Wigner and Matthews-Salam energy distributions. It is demonstrated that, for unstable particles with a larger width or decay energy threshold, the deviation from the generally accepted mean life τ m =Γ −1 is significant. The behavior of the decay (...) law P(t) for small times is analyzed, and it is shown that the Breit-Wigner distribution violates the condition P(t = 0) = 0, whereas the Matthews-Salam distribution satisfies it. (shrink)

Elementary Applied Symbolic Logic was first published by Prentice-Hall in 1976. It went through two editions with them, then had a successful classroom run of 25 years by various publishers, before it finally went out of print in 2001.I am reviving it here, because during its run it acquired a reputation as an outstanding textbook for getting students to understand symbolic logic.I immodestly believe it is the best textbook ever written on the subject.------------This is a book on applied symbolic (...) logic. It provides the bridge between statements and arguments in English, and their formal counterparts in symbolic logic. Extensive exercises are given, illustrating how different natural-language concepts can correspond to the same symbolism, and how English sentences may be translated into formulae. Translation is heavily emphasized.It is intended to make learning symbolic logic (relatively) easy, by starting out with very basics and progressing from there a step at a time, building on what came before. I tried to make it as close to a self-teaching text as I could manage. It has two major divisions: Propositional Logic and Quantifier Logic.The first starts with propositions and truth-values, then truth-tables for evaluating the status of statements and arguments. It then moves to natural deduction, with rules for making inferences and transformations. Procedures are given for proving both validity and invalidity.Exercises increase in complexity as things move along. Solutions to selected exercises are included at the back of the book.Quantifier Logic starts with Monadic predicate logic, involving only single-place predicates ("properties"). It starts with singular statements and propositional functions, then moves to statements containing a single universal or existential quantifier, then to statements and arguments involving multiple quantifiers. It covers inferences using quantificational inference and transformation rules, and gives methods of invalidity proof.Its second half goes into polyadic predicates ("relations") of various degrees, moves on to identity, and finally to definite descriptions.Appendices on various related and supplementary topics are included at the end. The original appendix on Completeness and Consistency was complicated and confusing. It has been deleted, and replaced with an addendum at the end. (shrink)

This paper obtains the weak completeness and decidability results for standard systems of modal logic using models built from formulas themselves. This line of work began with Fine (Notre Dame J. Form. Log. 16:229-237, 1975). There are two ways in which our work advances on that paper: First, the definition of our models is mainly based on the relation Kozen and Parikh used in their proof of the completeness of PDL, see (Theor. Comp. Sci. 113-118, 1981). The point is to (...) develop a general model-construction method based on this definition. We do this and thereby obtain the completeness of most of the standard modal systems, and in addition apply the method to some other systems of interest. None of the results use filtration, but in our final section we explore the connection. (shrink)

A canonical Gentzen-type system is a system in which every rule has the subformula property, it introduces exactly one occurrence of a connective, and it imposes no restrictions on the contexts of its applications. A larger class of Gentzen-type systems which is also extensively in use is that of quasi-canonical systems. In such systems a special role is given to a unary connective \ of the language. Accordingly, each application of a logical rule in such systems introduces either (...) a formula of the form \\), or of the form \\), and all the active formulas of its premises belong to the set \. In this paper we investigate the whole class of quasi-canonical systems. We provide a constructive coherence criterion for such systems, and show that a quasi-canonical system is coherent iff it is analytic iff it has a characteristic non-deterministic matrix which is based on some subset of the set of the four truth-values which are used in the famous Dunn–Belnap four-valued matrix for information processing. In addition, we determine when a quasi-canonical system admits cut-elimination. (shrink)

We generalize the \}\)-canonical formulas to \}\)-canonical rules, and prove that each intuitionistic multi-conclusion consequence relation is axiomatizable by \}\)-canonical rules. This yields a convenient characterization of stable superintuitionistic logics. The \}\)-canonical formulas are analogues of the \}\)-canonical formulas, which are the algebraic counterpart of Zakharyaschev’s canonical formulas for superintuitionistic logics. Consequently, stable si-logics are analogues of subframe si-logics. We introduce cofinal stable intuitionistic multi-conclusion consequence relations and cofinal stable si-logics, thus answering the question (...) of what the analogues of cofinal subframe logics should be. This is done by utilizing the \}\)-reduct of Heyting algebras. We prove that every cofinal stable si-logic has the finite model property, and that there are continuum many cofinal stable si-logics that are not stable. We conclude with several examples showing the similarities and differences between the classes of stable, cofinal stable, subframe, and cofinal subframe si-logics. (shrink)

We prove that from categoricity in λ+ we can get categoricity in all cardinals ≥ λ+ in a χ-tame abstract elementary classe [Formula: see text] which has arbitrarily large models and satisfies the amalgamation and joint embedding properties, provided [Formula: see text] and λ ≥ χ. For the missing case when [Formula: see text], we prove that [Formula: see text] is totally categorical provided that [Formula: see text] is categorical in [Formula: see text] and [Formula: see text].

Intensional logic has emerged, since the 1960' s, as a powerful theoretical and practical tool in such diverse disciplines as computer science, artificial intelligence, linguistics, philosophy and even the foundations of mathematics. The present volume is a collection of carefully chosen papers, giving the reader a taste of the frontline state of research in intensional logics today. Most papers are representative of new ideas and/or new research themes. The collection would benefit the researcher as well as the student. This book (...) is a most welcome addition to our series. The Editors CONTENTS PREFACE IX JOHAN VAN BENTHEM AND NATASHA ALECHINA Modal Quantification over Structured Domains PATRICK BLACKBURN AND WILFRIED MEYER-VIOL Modal Logic and Model-Theoretic Syntax 29 RUY J. G. B. DE QUEIROZ AND DOV M. GABBAY The Functional Interpretation of Modal Necessity 61 VLADIMIR V. RYBAKOV Logics of Schemes for First-Order Theories and Poly-Modal Propositional Logic 93 JERRY SELIGMAN The Logic of Correct Description 107 DIMITER VAKARELOV Modal Logics of Arrows 137 HEINRICH WANSING A Full-Circle Theorem for Simple Tense Logic 173 MICHAEL ZAKHARYASCHEV Canonical Formulas for Modal and Superintuitionistic Logics: A Short Outline 195 EDWARD N. ZALTA 249 The Modal Object Calculus and its Interpretation NAME INDEX 281 SUBJECT INDEX 285 PREFACE Intensional logic has many faces. In this preface we identify some prominent ones without aiming at completeness. (shrink)

We show that for finite n⩾3n⩾3, every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras, polyadic algebras, and polyadic equality algebras contains an infinite number of non-canonical formulas. We also show that the class of structures for each of these varieties is non-elementary. The proofs employ algebras derived from random graphs.

In spite of the existence of many examples of incomplete logics, it is an important problem to find intermediate predicate logics complete with respect to Kripke frame (or Kripke sheaf) semantics because they are closed under substitution. But, most of known completeness proofs of finitely axiomatizable logics are difficult to apply to other logics since they are highly dependent on the specific properties of given logics. So, it is preferable to find a general methods of completeness proof. We give some (...) results on this problem using canonical formulas of "propositional" logics 8,2ESS. (shrink)

The variety of Heyting algebras has two well-behaved locally finite reducts, the variety of bounded distributive lattices and the variety of implicative semilattices. The variety of bounded distributive lattices is generated by the →-free reducts of Heyting algebras, while the variety of implicative semilattices is generated by the ∨-free reducts. Each of these reducts gives rise to canonical formulas that generalize Jankov formulas and provide an axiomatization of all superintuitionistic logics. The ∨-free reducts of Heyting algebras give rise to (...) the -canonical formulas that we studied in an earlier work. Here we introduce the -canonical formulas, which are obtained from the study of the →-free reducts of Heyting algebras. We prove that every si-logic is axiomatizable by -canonical formulas. We also discuss the similarities and differences between these two kinds of canonical formulas. One of the main ingredients of these formulas is a designated subset D of pairs of elements of a finite subdirectly irreducible Heyting algebra A. When D=A2, we show that the -canonical formula of A is equivalent to the Jankov formula of A. On the other hand, when D=∅, the -canonical formulas produce a new class of si-logics we term stable si-logics. We prove that there are continuum many stable si-logics and that all stable si-logics have the finite model property. We also compare stable si-logics to splitting and subframe si-logics. (shrink)

In this paper thecanonicalmodal logics, a kind of complete modal logics introduced in K. Fine [4] and R. I. Goldblatt [5], will be characterized semantically using the concept of anultrafilter extension, an operation on frames inspired by the algebraic theory of modal logic. Theorem 8 of R. I. Goldblatt and S. K. Thomason [6] characterizing the modally definable Σ⊿-elementary classes of frames will follow as a corollary. A second corollary is Theorem 2 of [4] which states that any complete (...) modal logic defining a Σ⊿-elementary class of frames is canonical.The main tool in obtaining these results is the duality between modal algebras and general frames developed in R. I. Goldblatt [5]. The relevant notions and results from this theory will be stated in §2. The concept of a canonical modal logic is introduced and motivated in §3, which also contains the above-mentioned theorems. In §4, a kind of appendix to the preceding discussion, preservation of first-order sentences under ultrafilter extensions is discussed.The modal language to be considered here has an infinite supply of proposition letters, a propositional constant ⊥, the usual Boolean operators ¬, ∨, ∨, →, and ↔ —with ¬ and ∨ regarded as primitives—and the two unary modal operators ◇ and □ — ◇ being regarded as primitive. Modal formulas will be denoted by lower case Greek letters, sets of formulas by Greek capitals. (shrink)

A realizability notion that employs only Kalmar elementary functions is defined, and, relative to it, the soundness of EA-(Π₁⁰-IR), a fragment of Heyting Arithmetic (HA) with names and axioms for all elementary functions and induction rule restricted to Π₁⁰ formulae, is proved. As a corollary, it is proved that the provably recursive functions of EA-(Π₁⁰-IR) are precisely the elementary functions. Elementary realizability is proposed as a model of strict arithmetic constructivism, which allows only those constructive (...) procedures for which the amount of computational resources required can be bounded in advance. (shrink)

We introduce tame abstract elementary classes as a generalization of all cases of abstract elementary classes that are known to permit development of stability-like theory. In this paper, we explore stability results in this new context. We assume that [Formula: see text] is a tame abstract elementary class satisfying the amalgamation property with no maximal model. The main results include:. Theorem 0.1. Suppose that [Formula: see text] is not only tame, but [Formula: see text]-tame. If [Formula: see (...) text] and [Formula: see text] is Galois stable in μ, then [Formula: see text], where [Formula: see text] is a relative of κ from first order logic. [Formula: see text] is the Hanf number of the class [Formula: see text]. It is known that [Formula: see text]. The theorem generalizes a result from [17]. It is used to prove both the existence of Morley sequences for non-splitting and the following initial step towards a stability spectrum theorem for tame classes:. Theorem 0.2. If [Formula: see text] is Galois-stable in some [Formula: see text], then [Formula: see text] is stable in every κ with κμ=κ. For example, under GCH we have that [Formula: see text] Galois-stable in μ implies that [Formula: see text] is Galois-stable in μ+n for all n < ω. (shrink)

"œLuis Villoro y el canon cartesiano de la evidencia"La lectura ortodoxa o canónica de los textos filosóficos cartesianos supone que el clásico cree haber hallado fundamentos intrí­nsecamente evidentes e irrebatibles para normar según ellos las pretensiones de conocimiento. Esta serí­a la única manera de resistirse al escepticismo extremo. El libro de Villoro sobre Descartes investiga cómo podrí­an satisfacerse rigurosamente estos postulados y formula una propuesta sustantiva que parece expresarse en ciertas teorí­as cartesianas. Sin embargo, éstas deben separarse de otras muchas (...) doctrinas dogmáticas presentes en el corpus, que Villoro señala y rechaza. En el trabajo se examina y desecha la pretensión de validez de la teorí­a que propugna Villoro, y apoyándose en su aguda crí­tica a Descartes, se argumenta en contra de la interpretación canónica en su conjunto."œLuis Villoro and the cartesian canon of evidence"Orthodox or canonical understanding of cartesian philosophy supposes that, as the only way to resist extreme scepticism, Descartes advocates for intrinsically indubitable grounds for knowledge claims. In his book on Descartes, Luis Villoro investigates how these desiderata could possibly be satisfied in a rigorous way. He concludes with a substantive proposal, which according to himself, is plausibly expressed by some of Descartes"™ theories. These must be strictly separated from other, merely dogmatic doctrines present in the corpus. In this essay, I first subject to scrutiny the validity claim of the theory advocated by Villoro, and in a 2nd. section, starting from Villoro"™s analysis, argue in general against the canonical understanding of Descartes. (shrink)

We revisit the theory of amalgamation classes but we do not insist on staying within elementary classes.

We investigate the role of coalgebraic predicate logic, a logic for neighborhood frames first proposed by Chang, in the study of monotonic modal logics. We prove analogues of the Goldblatt–Thomason theorem and Fine’s canonicity theorem for classes of monotonic neighborhood frames closed under elementary equivalence in coalgebraic predicate logic. The elementary equivalence here can be relativized to the classes of monotonic, quasi-filter, augmented quasi-filter, filter, or augmented filter neighborhood frames, respectively. The original, Kripke-semantic versions of the theorems follow (...) as a special case concerning the classes of augmented filter neighborhood frames. (shrink)

According to a theorem due to Kenneth Kunen, under ZFC, there is no ordinal [Formula: see text] and nontrivial elementary embedding [Formula: see text]. His proof relied on the Axiom of Choice (AC), and no proof from ZF alone is has been discovered. [Formula: see text] is the assertion, introduced by Hugh Woodin, that [Formula: see text] is an ordinal and there is an elementary embedding [Formula: see text] with critical point [Formula: see text]. And [Formula: see text] (...) asserts that [Formula: see text] holds for some [Formula: see text]. The axiom [Formula: see text] is one of the strongest large cardinals not known to be inconsistent with AC. It is usually studied assuming ZFC in the full universe [Formula: see text] (in which case [Formula: see text] must be a limit ordinal), but we assume only ZF. We prove, assuming ZF [Formula: see text] [Formula: see text] [Formula: see text] “[Formula: see text] is an even ordinal”, that there is a proper class transitive inner model [Formula: see text] containing [Formula: see text] and satisfying ZF [Formula: see text] [Formula: see text] [Formula: see text] “there is an elementary embedding [Formula: see text]”; in fact we will have [Formula: see text] ⊆[Formula: see text], where [Formula: see text] witnesses [Formula: see text] in [Formula: see text]. This result was first proved by the author under the added assumption that [Formula: see text] exists; Gabe Goldberg noticed that this extra assumption was unnecessary. If also [Formula: see text] is a limit ordinal and [Formula: see text]-DC holds in [Formula: see text], then the model [Formula: see text] will also satisfy [Formula: see text]-DC. We show that ZFC [Formula: see text] “[Formula: see text] is even” [Formula: see text] [Formula: see text] implies [Formula: see text] exists for every [Formula: see text], but if consistent, this theory does not imply [Formula: see text] exists. (shrink)

A function f from ω1 to the ordinals is called a canonical function for an ordinal α if f represents α in any generic ultrapower induced by forcing with math formula. We introduce here a method for coding sets of ordinals using canonical functions from ω1 to ω1. Combining this approach with arguments from, we show, assuming the Continuum Hypothesis, that for each cardinal κ there is a forcing construction preserving cardinalities and cofinalities forcing that every subset of (...) κ is an element of the inner model math formula. (shrink)

A first-order sentence is quasi-modal if its class of models is closed under the modal validity preserving constructions of disjoint unions, inner substructures and bounded epimorphic images. It is shown that all members of the proper class of canonical structures of a modal logic Λ have the same quasi-modal first-order theory Ψ Λ . The models of this theory determine a modal logic Λ e which is the largest sublogic of Λ to be determined by an elementary class. (...) The canonical structures of Λ e also have Ψ Λ as their quasi-modal theory. In addition there is a largest sublogic Λ c of Λ that is determined by its canonical structures, and again the canonical structures of Λ c have Ψ Λ are their quasi-modal theory. Thus Ψ Λ = Ψ Λ c = Ψ Λ e . Finally, we show that all finite structures validating Λ are models of Ψ Λ , and that if Λ is determined by its finite structures, then Ψ Λ is equal to the quasi-modal theory of these structures. (shrink)

Ifκis a measurable cardinal, let us say that a measure onκis aκ-complete nonprincipal ultrafilter onκ. IfUis a measure onκ, letjUbe the canonical elementary embedding ofVinto its Ultrapower UltU. Ifxis a set, say thatUmovesxwhenjU≠x; say thatκmovesxwhen some measure onκmovesx. Recall Kunen's lemma : “Every ordinal is moved only by finitely many measurable cardinals.” Kunen's proof and Fleissner's proof are essentially nonconstructive.The following proposition can be proved by using elementary facts about iterated ultrapowers.Proposition.Let ‹Un: n ∈ ω› be a (...) sequence of measures on a strictly increasing sequence ‹κn: n ∈ ω› of measurable cardinals. Let U = ‹ Wα: α < ω2›, where Wωm + n= Um. Then, for each θ inUltU,if E is the support of θ inUltU,then, for all m ∈ ω, Ummoves θ iff E ∩ [ωm, ω)≠ ∅. (shrink)

In [E. Hrushovski, D. Palacín and A. Pillay, On the canonical base property, Selecta Math. (N.S.) 19(4) (2013) 865–877], Hrushovski and the authors proved, in a certain finite rank environment, that rigidity of definable Galois groups implies that [Formula: see text] has the canonical base property in a strong form; “internality to” being replaced by “algebraicity in”. In the current paper, we give a reasonably robust definition of the “strong canonical base property” in a rather more general (...) finite rank context than [E. Hrushovski, D. Palacín and A. Pillay, On the canonical base property, Selecta Math. (N.S.) 19(4) (2013) 865–877], and prove its equivalence with rigidity of the relevant definable Galois groups. The new direction is an elaboration on the old result that [Formula: see text]-based groups are rigid. (shrink)

When dealing with manuscripts transmitting otherwise unknown ancient texts and without asubscriptio, the work of a philologist and literary critic becomes both more difficult and more engrossing. Definitive proof is impossible; at the end there can only be a hypothesis. When dealing with a unique grammatical text, such a hypothesis becomes even more delicate because of the standardization of ancient grammar. But it can happen that, behind crystallized theoretical argumentation and apparently canonical formulas, interstices can be explored that lead (...) to unforeseen possibilities, more exciting—and even more suitable—than those that have already emerged. (shrink)

We examine a notion of an elementary particle in classical physics and suggest that its existence requires non-trivial homotopy of space-time. We show that non-trivial homotopy may naturally arise for space-times in which metric relations are generated by a canonical distance form factorized by a Weyl field. Some consequences of the presence of a Weyl field are discussed.

We present numerous natural algebraic examples without the so-called Canonical Base Property (CBP). We prove that every commutative unitary ring of finite Morley rank without finite-index proper ideals satisfies the CBP if and only if it is a field, a ring of positive characteristic or a finite direct product of these. In addition, we construct a CM-trivial commutative local ring with a finite residue field without the CBP. Furthermore, we also show that finite-dimensional non-associative algebras over an algebraically closed (...) field of characteristic [Formula: see text] give rise to triangular rings without the CBP. This also applies to Baudisch’s [Formula: see text]-step nilpotent Lie algebras, which yields the existence of a [Formula: see text]-step nilpotent group of finite Morley rank whose theory, in the pure language of groups, is CM-trivial and does not satisfy the CBP. (shrink)

Canonical Propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules have only pure logical rules with the sub-formula property, in which exactly one occurrence of a connective is introduced in the conclusion, and no other occurrence of any connective is mentioned anywhere else. In this paper we considerably generalize the notion of a “canonical system” to first-order languages and beyond. We extend the Propositional coherence criterion for the non-triviality of such systems to (...) rules with unary quantifiers and show that it remains constructive. Then we provide semantics for such canonical systems using 2-valued non-deterministic matrices extended to languages with quantifiers, and prove that the following properties are equivalent for a canonical system G: (1) G admits Cut-Elimination, (2) G is coherent, and (3) G has a characteristic 2-valued non-deterministic matrix. (shrink)

This book is dedicated to V.A. Yankov’s seminal contributions to the theory of propositional logics. His papers, published in the 1960s, are highly cited even today. The Yankov characteristic formulas have become a very useful tool in propositional, modal and algebraic logic. The papers contributed to this book provide the new results on different generalizations and applications of characteristic formulas in propositional, modal and algebraic logics. In particular, an exposition of Yankov’s results and their applications in algebraic logic, the theory (...) of admissible rules and refutation systems is included in the book. In addition, the reader can find the studies on splitting and join-splitting in intermediate propositional logics that are based on Yankov-type formulas which are closely related to canonical formulas, and the study of properties of predicate extensions of non-classical propositional logics. The book also contains an exposition of Yankov’s revolutionary approach to constructive proof theory. The editors also include Yankov’s contributions to history and philosophy of mathematics and foundations of mathematics, as well as an examination of his original interpretation of history of Greek philosophy and mathematics. (shrink)

We initiate a systematic investigation of the abstract elementary classes that have amalgamation, satisfy tameness, and are stable in some cardinal. Assuming the singular cardinal hypothesis, we prove a full characterization of the stability cardinals, and connect the stability spectrum with the behavior of saturated models.We deduce that if a class is stable on a tail of cardinals, then it has no long splitting chains. This indicates that there is a clear notion of superstability in this framework.We also present (...) an application to homogeneous model theory: for [Formula: see text] a homogeneous diagram in a first-order theory [Formula: see text], if [Formula: see text] is both stable in [Formula: see text] and categorical in [Formula: see text] then [Formula: see text] is stable in all [Formula: see text]. (shrink)