A generalization of modal definability

Size: px
Start display at page:

Download "A generalization of modal definability"

Transcription

1 A generalization of modal definability Tin Perkov Polytechnic of Zagreb Abstract. Known results on global definability in basic modal logic are generalized in the following sense. A class of Kripke models is usually called modally definable if there is a set of modal formulas such that a class consists exactly of models on which every formula of that set is globally true, i. e. universally quantified standard translations of these formulas to the corresponding first order language are true. Here, the notion of definability is extended to existentially quantified translations of modal formulas a class is called modally -definable if there is a set of modal formulas such that a class consists exactly of models on which every formula of that set is satisfiable. A characterization result is given in usual form, in terms of closure conditions on such classes of models. 1 Introduction One of the ways to measure the expressivity of a language is to establish conditions of definability, which outline the power of a language to describe properties of models. In modal logic, this can be done in a similar way on different levels of semantics. Only the Kripke semantics is considered in this paper, but even so we can speak about local definability on the level of pointed models, global definability for Kripke models (without designated point), or frame definability on the level of Kripke frames, where we demand that a defining formula is valid on a frame, i. e. globally true regardless of a choice of valuation of propositional variables. For the sake of simplicity, only the basic propositional modal language, which has one modal operator, is considered in this paper. As for the semantics, the global level of models is considered, with fixed valuation, but without designated point. Throughout the paper, notation and terminology follows [1], so some of the most basic definitions and results are omitted or only briefly reviewed. A Kripke frame for the basic modal language is a pair F = (W, R), where W is a non-empty set, and R a binary relation on W. A Kripke model based on a frame F is M = (W, R, V ), where V is a function called valuation, which maps every propositional letter p to a subset V (p) W. The truth of a formula is defined locally and inductively as usual, and denoted M, w ϕ. Namely, for the modal operator we have that a formula of a form ϕ is true in w W if M, u ϕ for some u such that wru. We say that a formula is globally true on M if it is true in every w W, and we denote this by M ϕ. On the other hand, a formula is called satisfiable if it is true in some w W.

2 A generalization of modal definability 129 A class K of Kripke models is modally definable if there is a set S of formulas such that K consists exactly of models on which every formula of S is globally true, i. e. K = {M : M S}. A way to answer to the question of expressiveness of a language is to establish model-theoretical closure conditions that are necessary and sufficient for a class of models to be modally definable. On the level of frames such conditions are given by the famous Goldblatt-Thomason theorem, and for pointed models we have de Rijke characterization (detailed proofs of both are given in [1]). For the global level of models we have the following characterization, which is really the starting point of this paper. Theorem (de Rijke-Sturm). A class K of models is globally definable by a set of modal formulas if and only if K is closed under surjective bisimulations, disjoint unions and ultraproducts, and K is closed under ultrapowers. A class K of models is globally definable by means of a single modal formula if and only if K is closed under surjective bisimulations and disjoint unions, and both K and K are closed under ultraproducts. Here, K denotes the complement of K, that is, the class of all models that are not in K. All of the truth-preserving model constructions used in the theorem bisimulations, disjoint unions and ultraproducts are described in detail in [1], and ultraproducts on even deeper level in [2], since they are fundamental for the first-order model theory. In fact, de Rijke-Sturm results are proved using correspondence between the basic modal language and the first-order language with one binary relation symbol R and a predicate symbol P for each propositional letter p of the basic modal language. It is clear that a Kripke model can be viewed as a model for this first-order language. Correspondence is naturally established by the standard translation, a function that maps every modal formula ϕ to the first-order formula ST x (ϕ), which is defined as follows: ST x (p) = P x, for each propositional letter p ST x ( ) = x x ST x ( ϕ) = ST x (ϕ) ST x (ϕ ψ) = ST x (ϕ) ST x (ψ) ST x ( ϕ) = y(xry ST y (ϕ)) The basic property of the standard translation is that M ϕ if and only if M = xst x (ϕ). Therefore it is clear that every modally definable class of Kripke models is elementary, i. e. definable by a set of first-order formulas. These formulas are of the form xst x (ϕ). This is the point where the idea of this paper emerges. Why not consider the classes definable by formulas of the form xst x (ϕ) also modally definable? For example, the formula defines the class of models such that each point has an R-successor, but its complement, i. e. the class of models such that there is a point which has no successors, is not modally definable, since it is not closed under surjective bisimulations. On the other hand, this class consists exactly of

3 130 Tin Perkov models on which the formula, i. e., is satisfiable. Following definition enables us to consider any such example also modally definable in a broader sense. Definition. A class K of Kripke models is called modally -definable if there is a set S of modal formulas such that K consists exactly of models on which every formula from S is satisfiable. Note that it is not required that all formulas of S are satisfied at the same point of a model it suffices that each formula of S is satisfied at some point. It seems natural to generalize the notion of modal definability on the global level of models such that it includes -definable classes, together with modally definable classes in usual sense. A prospect of further generalization is outlined in the concluding section of this paper. The following characterization, proof of which is the main result of this paper, holds. Theorem. Let K be a class of Kripke models. 1. K is -definable by a single modal formula if and only if K is closed under total bisimulations and ultraproducts, and K is closed under disjoint unions and ultraproducts. 2. K is -definable by a finite set of modal formulas if and only if K is closed under total bisimulations and ultraproducts, and K is closed under ultraproducts. 3. K is -definable by a set of modal formulas if and only if K is closed under total bisimulations and ultraproducts, and K is closed under ultrapowers. 2 Modal -definability by a finite set of formulas The proof of the statement (1) of the main theorem is trivial, for a case of single formula is exactly dual to the notion of global modal definability by a single formula. Note the obvious fact that any class of models is closed under surjective bisimulations if and only if its complement is closed under total bisimulations. This fact is used for the purpose of minimizing the number of conditions imposed on the complement in characterizations. Proof (of 1). The statement follows from the fact that K is -definable by a single formula if and only if K is globally definable by a single formula. This is a consequence of the fact that ϕ is globally true on a model M if and only if ϕ is not satisfiable on M. Proofs of other statements, however, are not so trivial, since the notion of -definability by a set of formulas is not exactly dual to the notion of global definability. Clearly, a class is globally definable by a set of formulas if and only if its complement consists exactly of models on which a negation of some formula from that set is satisfiable. To say that a class is -definable, means that each formula from the defining set is satisfiable.

4 A generalization of modal definability 131 The following observation, given by de Rijke and Sturm in the concluding remarks of [4], is used in the proof of the second statement of the theorem. Proposition 1. A class K of models is -definable, i. e. definable by a set of formulas of the form xst x (ϕ 1 ) xst x (ϕ n ) for some modal formulas ϕ 1,..., ϕ n, if and only if K is closed under surjective bisimulations and ultraproducts, and K is closed under ultrapowers. Proof. Omitted fairly standard argument is used. Proof (of 2). Let S = {ϕ 1,..., ϕ n } be a set of modal formulas and let M be a model. Assume that there is a formula from S that is not satisfiable in M. Clearly, negation of that formula is globally true on M, so we have M = xst x ( ϕ 1 ) xst x ( ϕ n ). It easily follows that a class K is -definable by a finite set of formulas if and only if K is -definable by a single formula. By an easy compactness argument from Proposition 1 it follows that a class K is -definable by a single formula if and only if K is closed under surjective bisimulations and ultraproducts, and K is also closed under ultraproducts. The claim immediately follows. Before turning to the infinite case, note that we have got the following preservation result as a consequence of previously established facts. Corollary. A first-order sentence α (over the appropriate alphabet) is equivalent to a formula xst x (ϕ 1 ) xst x (ϕ n ) for some modal formulas ϕ 1,..., ϕ n if and only if it is preserved under total bisimulations. 3 Modal -definability by an infinite set of formulas In this section the infinite disjunctions are used, hopefully on the intuitively clear level which does not call for the proper introduction to the infinitary languages. Results could have been stated and proved without the use of infinite formulas this usage is just for the purpose of clearer statements and easier observation of analogies to the finite case. A -formula is a countably infinite disjunction of the form xst x (ϕ 1 ) xst x (ϕ 2 ) xst x (ϕ 3 )..., for some modal formulas ϕ k, k N. Of course, such formula is true if and only if there exists k N such that xst x (ϕ k ) is true. Saying that a class K of Kripke models is -definable means that there is a set of -formulas such that K consists exactly of models on which all of the formulas from that set are true. Since we work in the language with countably many propositional variables, it is clear, by analogy to the finite case, that a class K of models is -definable if and only if its complement is -definable by a single formula. Proposition 2. A class K of models is -definable if and only if K is closed under surjective bisimulations and ultrapowers, and K is closed under ultrapowers.

5 132 Tin Perkov Proof. The necessity of all conditions stated in the proposition for a class to be -definable is easily verified. For the converse, assume that K fulfils all of the closure conditions stated above. Let S be the set of all -formulas that are true on all models in K. Clearly, K lies in the class defined by S, so to prove that S defines K it remains to show that any model on which all of the formulas from S are true is in fact in K. So, let M be a model such that M = S. Let Σ denote the set of all formulas satisfiable in M. There is a model N in K such that each formula from Σ is satisfiable in N. For if not, we have that -formula σ Σ ( xst x ( σ)) is true on all models in K, so it is in S, hence M σ for some σ Σ, which is a contradiction. It is a well-known fact of classical model theory that the ultrapower U N over a countably incomplete ultrafilter U is an ω-saturated elementary extension of N (see [2]), which has a consequence that every formula from Σ is satisfiable in U N. By assumption, U N is in K, and we can assume without loss of generality that M is also saturated. The reader familiar with modal logic knows that the modal equivalence between points of saturated models is in fact a bisimulation. Thus we have a bisimulation from U N to M. To prove that this bisimulation is surjective, let w be any point from M and define Σ w = {σ : M, w σ}. Clearly, Σ w Σ, so we already have that each formula from Σ w is satisfiable in U N. Now, since Σ w is closed under conjunctions, it is finitely satisfiable in U N, which is ω-saturated, thus Σ w is satisfiable in U N. This means that there is an element in U N modally equivalent with w, as desired. This shows that M is also in K, which concludes the proof. Proof (of 3). Due to the previous observations, it suffices to show that K is - definable by a single formula if and only if it is closed under surjective bisimulations and ultrapowers, and K is closed under ultraproducts. Again, necessity is easily verified by definitions. For the converse, let K be a class of models such that all of the above closure conditions hold. It follows from Proposition 2 that K is -definable. Let S be a set of all -formulas that are true on all models from K. Suppose that there is no single -formula α such that K is actually defined by α. So, for any α S there is a model M α in K such that M α = α. For each member xst x (α i ) of the disjunction α such that M α = xst x (α i ), define I αi = {σ S : M σ = xst x (α i )}. Clearly, the family of all these subsets of S has the finite intersection property. So, it can be extended to an ultrafilter U over S. (This is one of the basic properties of ultrafilters, which can be recalled using [1] or [2].) Since K is closed under ultraproducts by assumption, we have that U M σ is also in K. But, for any I αi we have I αi U, so (by Loś fundamental theorem on ultraproducts see [2]) we have U M σ = xst x (α i ), thus U M σ = α for all α S. Since S defines K, U M σ is in K, which is a contradiction.

6 A generalization of modal definability Concluding remarks On the level of Kripke frames, a notion somewhat similar to -definability is the negative definability, defined by Venema in [5], and characterized for some special cases by Hollenberg in [3]. In cited papers, a class of frames is called negatively definable if there is a set of formulas such that a class consists exactly of frames such that any formula of that set is refutable in all points, under some valuation. There is a difference, for satisfiability on the level of frames here means that formula is satisfiable everywhere (by some valuation), while on the level of models it means that it is satisfiable somewhere (with fixed valuation). To generalize the perspective of expressivity of modal logic, it may be worthwhile to try to define more analogous notion of satisfiability and -definability for the level of frames and to give characterization of such definability. Also, similarly to the notion of ±-definability in [3], the notion of generalized modal definability could be defined by saying that a class of models is modally definable if there is a pair (S 1, S 2 ) of sets of formulas such that a class consists exactly of models on which every formula from S 1 is globally true and every formula from S 2 is satisfiable. A model-theoretical characterization of this kind of definability, which is a proper generalization of usual modal definability and -definability, will be presented in a near future paper. References 1. J. Blackburn, M. de Rijke, Y. Venema, Modal Logic, Springer-Verlag, C.C. Chang, H.J. Keisler, Model Theory, Elsevier, M. Hollenberg, Characterizations of Negative Definability in Modal Logic, Studia Logica, 60: , M. de Rijke, H. Sturm, Global Definability in Basic Modal Logic, in: H. Wansing (ed.), Essays on Non-classical Logic, World Scientific Publishers, Y. Venema, Derivation rules as anti-axioms in modal logic, Journal of Symbolic Logic, 58: , 1993.

Existential definability of modal frame classes

Existential definability of modal frame classes Existential definability of modal frame classes Tin Perkov Polytechnic of Zagreb, Croatia tin.perkov@tvz.hr Abstract. A class of Kripke frames is called modally definable if there is a set of modal formulas

More information

Annals of Pure and Applied Logic

Annals of Pure and Applied Logic Annals of Pure and Applied Logic 163 (2012) 1928 1939 Contents lists available at SciVerse ScienceDirect Annals of Pure and Applied Logic www.elsevier.com/locate/apal Some characterization and preservation

More information

A Note on Graded Modal Logic

A Note on Graded Modal Logic A Note on Graded Modal Logic Maarten de Rijke Studia Logica, vol. 64 (2000), pp. 271 283 Abstract We introduce a notion of bisimulation for graded modal logic. Using these bisimulations the model theory

More information

Modal logics and their semantics

Modal logics and their semantics Modal logics and their semantics Joshua Sack Department of Mathematics and Statistics, California State University Long Beach California State University Dominguez Hills Feb 22, 2012 Relational structures

More information

Global vs. Local in Basic Modal Logic

Global vs. Local in Basic Modal Logic Global vs. Local in Basic Modal Logic Maarten de Rijke 1 and Holger Sturm 2 1 ILLC, University of Amsterdam, Pl. Muidergracht 24, 1018 TV Amsterdam, The Netherlands. E-mail: mdr@wins.uva.nl 2 Institut

More information

Interpretability Logic

Interpretability Logic Interpretability Logic Logic and Applications, IUC, Dubrovnik vukovic@math.hr web.math.pmf.unizg.hr/ vukovic/ Department of Mathematics, Faculty of Science, University of Zagreb September, 2013 Interpretability

More information

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed

More information

Axiomatisation of Hybrid Logic

Axiomatisation of Hybrid Logic Imperial College London Department of Computing Axiomatisation of Hybrid Logic by Louis Paternault Submitted in partial fulfilment of the requirements for the MSc Degree in Advanced Computing of Imperial

More information

Generalizing the Goldblatt-Thomason Theorem and Modal Definability

Generalizing the Goldblatt-Thomason Theorem and Modal Definability SUVI LEHTINEN Generalizing the Goldblatt-Thomason Theorem and Modal Definability ACADEMIC DISSERTATION To be presented, with the permission of the Faculty of Information Sciences of the University of Tampere,

More information

3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.

3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas. 1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is

More information

Basic Model Theory for Memory Logics

Basic Model Theory for Memory Logics Basic Model Theory for Memory Logics Carlos Areces 1, Facundo Carreiro 2, Santiago Figueira 2,3 and Sergio Mera 2 1 INRIA Nancy Grand Est, Nancy, France areces@loria.fr 2 Dto. Computación, FCEN, Universidad

More information

18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015)

18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015) 18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015) 1. Introduction The goal for this course is to provide a quick, and hopefully somewhat gentle, introduction to the task of formulating

More information

Löwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007)

Löwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007) Löwenheim-Skolem Theorems, Countable Approximations, and L ω 0. Introduction David W. Kueker (Lecture Notes, Fall 2007) In its simplest form the Löwenheim-Skolem Theorem for L ω1 ω states that if σ L ω1

More information

ULTRAPRODUCTS AND MODEL THEORY

ULTRAPRODUCTS AND MODEL THEORY ULTRAPRODUCTS AND MODEL THEORY AARON HALPER Abstract. The first-order model-theoretic description of mathematical structures is unable to always uniquely characterize models up to isomorphism when the

More information

USING ULTRAPOWERS TO CHARACTERIZE ELEMENTARY EQUIVALENCE

USING ULTRAPOWERS TO CHARACTERIZE ELEMENTARY EQUIVALENCE USING ULTRAPOWERS TO CHARACTERIZE ELEMENTARY EQUIVALENCE MIKAYLA KELLEY Abstract. This paper will establish that ultrapowers can be used to determine whether or not two models have the same theory. More

More information

Goldblatt-Thomason-style Theorems for Graded Modal Language

Goldblatt-Thomason-style Theorems for Graded Modal Language Goldblatt-Thomason-style Theorems for Graded Modal Language Katsuhiko Sano JSPS Research Fellow Department of Humanistic Informatics, Kyoto University, Japan ILLC, Universiteit van Amsterdam Minghui Ma

More information

Syntactic Characterisations in Model Theory

Syntactic Characterisations in Model Theory Department of Mathematics Bachelor Thesis (7.5 ECTS) Syntactic Characterisations in Model Theory Author: Dionijs van Tuijl Supervisor: Dr. Jaap van Oosten June 15, 2016 Contents 1 Introduction 2 2 Preliminaries

More information

MATHEMATICS: CONCEPTS, AND FOUNDATIONS Vol. II - Model Theory - H. Jerome Keisler

MATHEMATICS: CONCEPTS, AND FOUNDATIONS Vol. II - Model Theory - H. Jerome Keisler ATHEATCS: CONCEPTS, AND FOUNDATONS Vol. - odel Theory - H. Jerome Keisler ODEL THEORY H. Jerome Keisler Department of athematics, University of Wisconsin, adison Wisconsin U.S.A. Keywords: adapted probability

More information

A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ

A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ NICOLAS FORD Abstract. The goal of this paper is to present a proof of the Nullstellensatz using tools from a branch of logic called model theory. In

More information

Logics above S4 and the Lebesgue measure algebra

Logics above S4 and the Lebesgue measure algebra Logics above S4 and the Lebesgue measure algebra Tamar Lando Abstract We study the measure semantics for propositional modal logics, in which formulas are interpreted in the Lebesgue measure algebra M,

More information

Model Theory of Modal Logic Lecture 5. Valentin Goranko Technical University of Denmark

Model Theory of Modal Logic Lecture 5. Valentin Goranko Technical University of Denmark Model Theory of Modal Logic Lecture 5 Valentin Goranko Technical University of Denmark Third Indian School on Logic and its Applications Hyderabad, January 29, 2010 Model Theory of Modal Logic Lecture

More information

arxiv:math/ v1 [math.lo] 5 Mar 2007

arxiv:math/ v1 [math.lo] 5 Mar 2007 Topological Semantics and Decidability Dmitry Sustretov arxiv:math/0703106v1 [math.lo] 5 Mar 2007 March 6, 2008 Abstract It is well-known that the basic modal logic of all topological spaces is S4. However,

More information

Majority Logic. Introduction

Majority Logic. Introduction Majority Logic Eric Pacuit and Samer Salame Department of Computer Science Graduate Center, City University of New York 365 5th Avenue, New York 10016 epacuit@cs.gc.cuny.edu, ssalame@gc.cuny.edu Abstract

More information

Model Theory of Modal Logic Lecture 4. Valentin Goranko Technical University of Denmark

Model Theory of Modal Logic Lecture 4. Valentin Goranko Technical University of Denmark Model Theory of Modal Logic Lecture 4 Valentin Goranko Technical University of Denmark Third Indian School on Logic and its Applications Hyderabad, January 28, 2010 Model Theory of Modal Logic Lecture

More information

Abstract model theory for extensions of modal logic

Abstract model theory for extensions of modal logic Abstract model theory for extensions of modal logic Balder ten Cate Stanford, May 13, 2008 Largely based on joint work with Johan van Benthem and Jouko Väänänen Balder ten Cate Abstract model theory for

More information

Tecniche di Verifica. Introduction to Propositional Logic

Tecniche di Verifica. Introduction to Propositional Logic Tecniche di Verifica Introduction to Propositional Logic 1 Logic A formal logic is defined by its syntax and semantics. Syntax An alphabet is a set of symbols. A finite sequence of these symbols is called

More information

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together

More information

A SEQUENT SYSTEM OF THE LOGIC R FOR ROSSER SENTENCES 2. Abstract

A SEQUENT SYSTEM OF THE LOGIC R FOR ROSSER SENTENCES 2. Abstract Bulletin of the Section of Logic Volume 33/1 (2004), pp. 11 21 Katsumi Sasaki 1 Shigeo Ohama A SEQUENT SYSTEM OF THE LOGIC R FOR ROSSER SENTENCES 2 Abstract To discuss Rosser sentences, Guaspari and Solovay

More information

HENNESSY MILNER THEOREM FOR INTERPRETABILITY LOGIC. Abstract

HENNESSY MILNER THEOREM FOR INTERPRETABILITY LOGIC. Abstract Bulletin of the Section of Logic Volume 34/4 (2005), pp. 195 201 Mladen Vuković HENNESSY MILNER THEOREM FOR INTERPRETABILITY LOGIC Abstract Interpretability logic is a modal description of the interpretability

More information

Modal Dependence Logic

Modal Dependence Logic Modal Dependence Logic Jouko Väänänen Institute for Logic, Language and Computation Universiteit van Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam, The Netherlands J.A.Vaananen@uva.nl Abstract We

More information

Semantic Characterization of Kracht Formulas

Semantic Characterization of Kracht Formulas Semantic Characterization of Kracht Formulas Stanislav Kikot Moscow State University Moscow, Vorobjovy Gory, 1 Abstract Kracht formulas are first-order correspondents of modal Sahlqvist formulas. In this

More information

Some consequences of compactness in Lukasiewicz Predicate Logic

Some consequences of compactness in Lukasiewicz Predicate Logic Some consequences of compactness in Lukasiewicz Predicate Logic Luca Spada Department of Mathematics and Computer Science University of Salerno www.logica.dmi.unisa.it/lucaspada 7 th Panhellenic Logic

More information

Introduction to Metalogic

Introduction to Metalogic Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)

More information

Applied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw

Applied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018

More information

Ultraproducts of Admissible Models for Quantified Modal Logic

Ultraproducts of Admissible Models for Quantified Modal Logic Ultraproducts of Admissible Models for Quantified Modal Logic Robert Goldblatt Abstract Admissible models for quantified modal logic have a restriction on which sets of worlds are admissible as propositions.

More information

Introduction. Itaï Ben-Yaacov C. Ward Henson. September American Institute of Mathematics Workshop. Continuous logic Continuous model theory

Introduction. Itaï Ben-Yaacov C. Ward Henson. September American Institute of Mathematics Workshop. Continuous logic Continuous model theory Itaï Ben-Yaacov C. Ward Henson American Institute of Mathematics Workshop September 2006 Outline Continuous logic 1 Continuous logic 2 The metric on S n (T ) Origins Continuous logic Many classes of (complete)

More information

Adding Modal Operators to the Action Language A

Adding Modal Operators to the Action Language A Adding Modal Operators to the Action Language A Aaron Hunter Simon Fraser University Burnaby, B.C. Canada V5A 1S6 amhunter@cs.sfu.ca Abstract The action language A is a simple high-level language for describing

More information

Informal Statement Calculus

Informal Statement Calculus FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example

More information

Axiomatizing hybrid logic using modal logic

Axiomatizing hybrid logic using modal logic Axiomatizing hybrid logic using modal logic Ian Hodkinson Department of Computing Imperial College London London SW7 2AZ United Kingdom imh@doc.ic.ac.uk Louis Paternault 4 rue de l hôpital 74800 La Roche

More information

Short Introduction to Admissible Recursion Theory

Short Introduction to Admissible Recursion Theory Short Introduction to Admissible Recursion Theory Rachael Alvir November 2016 1 Axioms of KP and Admissible Sets An admissible set is a transitive set A satisfying the axioms of Kripke-Platek Set Theory

More information

Axiomatizing hybrid logic using modal logic

Axiomatizing hybrid logic using modal logic Axiomatizing hybrid logic using modal logic Ian Hodkinson Department of Computing Imperial College London London SW7 2AZ United Kingdom imh@doc.ic.ac.uk Louis Paternault 4 rue de l hôpital 74800 La Roche

More information

Krivine s Intuitionistic Proof of Classical Completeness (for countable languages)

Krivine s Intuitionistic Proof of Classical Completeness (for countable languages) Krivine s Intuitionistic Proof of Classical Completeness (for countable languages) Berardi Stefano Valentini Silvio Dip. Informatica Dip. Mat. Pura ed Applicata Univ. Torino Univ. Padova c.so Svizzera

More information

Vietoris bisimulations

Vietoris bisimulations Vietoris bisimulations N. Bezhanishvili, G. Fontaine and Y. Venema July 17, 2008 Abstract Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces,

More information

Definability for Downward and Vertical XPath on Data Trees

Definability for Downward and Vertical XPath on Data Trees Definability for Downward and Vertical XPath on Data Trees Sergio Abriola 1, María Emilia Descotte 1, and Santiago Figueira 1,2 1 University of Buenos Aires, Argentina 2 CONICET, Argentina Abstract. We

More information

HANDOUT AND SET THEORY. Ariyadi Wijaya

HANDOUT AND SET THEORY. Ariyadi Wijaya HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics

More information

Introduction to Model Theory

Introduction to Model Theory Introduction to Model Theory Charles Steinhorn, Vassar College Katrin Tent, University of Münster CIRM, January 8, 2018 The three lectures Introduction to basic model theory Focus on Definability More

More information

The McKinsey Lemmon logic is barely canonical

The McKinsey Lemmon logic is barely canonical The McKinsey Lemmon logic is barely canonical Robert Goldblatt and Ian Hodkinson July 18, 2006 Abstract We study a canonical modal logic introduced by Lemmon, and axiomatised by an infinite sequence of

More information

The non-logical symbols determine a specific F OL language and consists of the following sets. Σ = {Σ n } n<ω

The non-logical symbols determine a specific F OL language and consists of the following sets. Σ = {Σ n } n<ω 1 Preliminaries In this chapter we first give a summary of the basic notations, terminology and results which will be used in this thesis. The treatment here is reduced to a list of definitions. For the

More information

Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic

Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic Joseph Y. Halpern Computer Science Department Cornell University, U.S.A. e-mail: halpern@cs.cornell.edu Leandro Chaves Rêgo

More information

De Jongh s characterization of intuitionistic propositional calculus

De Jongh s characterization of intuitionistic propositional calculus De Jongh s characterization of intuitionistic propositional calculus Nick Bezhanishvili Abstract In his PhD thesis [10] Dick de Jongh proved a syntactic characterization of intuitionistic propositional

More information

Bisimulation for Neighbourhood Structures

Bisimulation for Neighbourhood Structures Bisimulation for Neighbourhood Structures Helle Hvid Hansen 1,2 Clemens Kupke 2 Eric Pacuit 3 1 Vrije Universiteit Amsterdam (VUA) 2 Centrum voor Wiskunde en Informatica (CWI) 3 Universiteit van Amsterdam

More information

Algebraizing Hybrid Logic. Evangelos Tzanis University of Amsterdam Institute of Logic, Language and Computation

Algebraizing Hybrid Logic. Evangelos Tzanis University of Amsterdam Institute of Logic, Language and Computation Algebraizing Hybrid Logic Evangelos Tzanis University of Amsterdam Institute of Logic, Language and Computation etzanis@science.uva.nl May 1, 2005 2 Contents 1 Introduction 5 1.1 A guide to this thesis..........................

More information

Propositional and Predicate Logic - V

Propositional and Predicate Logic - V Propositional and Predicate Logic - V Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - V WS 2016/2017 1 / 21 Formal proof systems Hilbert s calculus

More information

PRESERVATION THEOREMS IN LUKASIEWICZ MODEL THEORY

PRESERVATION THEOREMS IN LUKASIEWICZ MODEL THEORY Iranian Journal of Fuzzy Systems Vol. 10, No. 3, (2013) pp. 103-113 103 PRESERVATION THEOREMS IN LUKASIEWICZ MODEL THEORY S. M. BAGHERI AND M. MONIRI Abstract. We present some model theoretic results for

More information

Syntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.

Syntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P. First-Order Logic Syntax The alphabet of a first-order language is organised into the following categories. Logical connectives:,,,,, and. Auxiliary symbols:.,,, ( and ). Variables: we assume a countable

More information

ECE353: Probability and Random Processes. Lecture 2 - Set Theory

ECE353: Probability and Random Processes. Lecture 2 - Set Theory ECE353: Probability and Random Processes Lecture 2 - Set Theory Xiao Fu School of Electrical Engineering and Computer Science Oregon State University E-mail: xiao.fu@oregonstate.edu January 10, 2018 Set

More information

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS 1 Language There are several propositional languages that are routinely called classical propositional logic languages. It is due to the functional dependency

More information

Automata Theory and Formal Grammars: Lecture 1

Automata Theory and Formal Grammars: Lecture 1 Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)

More information

Handbook of Logic and Proof Techniques for Computer Science

Handbook of Logic and Proof Techniques for Computer Science Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives

More information

An Introduction to Modal Logic III

An Introduction to Modal Logic III An Introduction to Modal Logic III Soundness of Normal Modal Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 24 th 2013 Marco Cerami

More information

TRANSFERING SATURATION, THE FINITE COVER PROPERTY, AND STABILITY

TRANSFERING SATURATION, THE FINITE COVER PROPERTY, AND STABILITY TRANSFERING SATURATION, THE FINITE COVER PROPERTY, AND STABILITY John T. Baldwin Department of Mathematics University of Illinois at Chicago Chicago, IL 60680 Rami Grossberg Department of Mathematics Carnegie

More information

Proving Completeness for Nested Sequent Calculi 1

Proving Completeness for Nested Sequent Calculi 1 Proving Completeness for Nested Sequent Calculi 1 Melvin Fitting abstract. Proving the completeness of classical propositional logic by using maximal consistent sets is perhaps the most common method there

More information

Modal Languages for Topology: Expressivity and Definability

Modal Languages for Topology: Expressivity and Definability Modal Languages for Topology: Expressivity and Definability Balder ten Cate, David Gabelaia and Dmitry Sustretov arxiv:math/0610357v2 [math.lo] 12 Oct 2006 13th November 2018 Abstract In this paper we

More information

The logic of subset spaces, topologic and the local difference modality K

The logic of subset spaces, topologic and the local difference modality K The logic of subset spaces, topologic and the local difference modality K Isabel Bevort July 18, 2013 Bachelor Thesis in Mathematics Supervisor: dr. Alexandru Baltag Korteweg-De Vries Instituut voor Wiskunde

More information

EXCURSIONS IN MODEL THEORY

EXCURSIONS IN MODEL THEORY EXCURSIONS IN MODEL THEORY RAFAEL WINGESTER RIBEIRO DE OLIVEIRA Abstract. This paper aims to introduce the reader familiar with undergraduate level logic to some fundamental constructions in Model Theory.

More information

VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents

VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0 BENJAMIN LEDEAUX Abstract. This expository paper introduces model theory with a focus on countable models of complete theories. Vaught

More information

Formal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University

Formal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University Formal Epistemology: Lecture Notes Horacio Arló-Costa Carnegie Mellon University hcosta@andrew.cmu.edu Logical preliminaries Let L 0 be a language containing a complete set of Boolean connectives, including

More information

HOW DO ULTRAFILTERS ACT ON THEORIES? THE CUT SPECTRUM AND TREETOPS

HOW DO ULTRAFILTERS ACT ON THEORIES? THE CUT SPECTRUM AND TREETOPS HOW DO ULTRAFILTERS ACT ON THEORIES? THE CUT SPECTRUM AND TREETOPS DIEGO ANDRES BEJARANO RAYO Abstract. We expand on and further explain the work by Malliaris and Shelah on the cofinality spectrum by doing

More information

ALL NORMAL EXTENSIONS OF S5-SQUARED ARE FINITELY AXIOMATIZABLE

ALL NORMAL EXTENSIONS OF S5-SQUARED ARE FINITELY AXIOMATIZABLE ALL NORMAL EXTENSIONS OF S5-SQUARED ARE FINITELY AXIOMATIZABLE Nick Bezhanishvili and Ian Hodkinson Abstract We prove that every normal extension of the bi-modal system S5 2 is finitely axiomatizable and

More information

March 3, The large and small in model theory: What are the amalgamation spectra of. infinitary classes? John T. Baldwin

March 3, The large and small in model theory: What are the amalgamation spectra of. infinitary classes? John T. Baldwin large and large and March 3, 2015 Characterizing cardinals by L ω1,ω large and L ω1,ω satisfies downward Lowenheim Skolem to ℵ 0 for sentences. It does not satisfy upward Lowenheim Skolem. Definition sentence

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

LINDSTRÖM S THEOREM SALMAN SIDDIQI

LINDSTRÖM S THEOREM SALMAN SIDDIQI LINDSTRÖM S THEOREM SALMAN SIDDIQI Abstract. This paper attempts to serve as an introduction to abstract model theory. We introduce the notion of abstract logics, explore first-order logic as an instance

More information

The Countable Henkin Principle

The Countable Henkin Principle The Countable Henkin Principle Robert Goldblatt Abstract. This is a revised and extended version of an article which encapsulates a key aspect of the Henkin method in a general result about the existence

More information

The seed order. Gabriel Goldberg. October 11, 2018

The seed order. Gabriel Goldberg. October 11, 2018 The seed order Gabriel Goldberg October 11, 2018 arxiv:1810.04284v1 [math.lo] 9 Oct 2018 Abstract e study various orders on countably complete ultrafilters on ordinals that coincide and are wellorders

More information

Review CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2.

Review CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2. CHAPTER 2 Review 2.1 Definitions in Chapter 2 2.1 Set; Element; Member; Universal Set 2.2 Subset 2.3 Proper Subset 2.4 The Empty Set, 2.5 Set Equality 2.6 Cardinality; Infinite Set 2.7 Complement 2.8 Intersection

More information

Incomplete version for students of easllc2012 only. 6.6 The Model Existence Game 99

Incomplete version for students of easllc2012 only. 6.6 The Model Existence Game 99 98 First-Order Logic 6.6 The Model Existence Game In this section we learn a new game associated with trying to construct a model for a sentence or a set of sentences. This is of fundamental importance

More information

Centrum voor Wiskunde en Informatica REPORTRAPPORT. Modal model theory. M. de Rijke. Computer Science/Department of Software Technology

Centrum voor Wiskunde en Informatica REPORTRAPPORT. Modal model theory. M. de Rijke. Computer Science/Department of Software Technology Centrum voor Wiskunde en Informatica REPORTRAPPORT Modal model theory M. de Rijke Computer Science/Department of Software Technology CS-R9517 1995 Report CS-R9517 ISSN 0169-118X CWI P.O. Box 94079 1090

More information

Gödel s Incompleteness Theorems

Gödel s Incompleteness Theorems Seminar Report Gödel s Incompleteness Theorems Ahmet Aspir Mark Nardi 28.02.2018 Supervisor: Dr. Georg Moser Abstract Gödel s incompleteness theorems are very fundamental for mathematics and computational

More information

Atom structures and Sahlqvist equations

Atom structures and Sahlqvist equations Atom structures and Sahlqvist equations Yde Venema Department of Mathematics and Computer Science Vrije Universiteit De Boelelaan 1081 1081 HV Amsterdam July 28, 1997 Abstract This paper addresses the

More information

Axioms for Set Theory

Axioms for Set Theory Axioms for Set Theory The following is a subset of the Zermelo-Fraenkel axioms for set theory. In this setting, all objects are sets which are denoted by letters, e.g. x, y, X, Y. Equality is logical identity:

More information

Propositional and Predicate Logic - II

Propositional and Predicate Logic - II Propositional and Predicate Logic - II Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - II WS 2016/2017 1 / 16 Basic syntax Language Propositional logic

More information

The Logic of Proofs, Semantically

The Logic of Proofs, Semantically The Logic of Proofs, Semantically Melvin Fitting Dept. Mathematics and Computer Science Lehman College (CUNY), 250 Bedford Park Boulevard West Bronx, NY 10468-1589 e-mail: fitting@lehman.cuny.edu web page:

More information

DISJOINT-UNION PARTIAL ALGEBRAS

DISJOINT-UNION PARTIAL ALGEBRAS Logical Methods in Computer Science Vol. 13(2:10)2017, pp. 1 31 https://lmcs.episciences.org/ Submitted Dec. 07, 2016 Published Jun. 22, 2017 DISJOINT-UNION PARTIAL ALGEBRAS ROBIN HIRSCH AND BRETT MCLEAN

More information

1 Completeness Theorem for Classical Predicate

1 Completeness Theorem for Classical Predicate 1 Completeness Theorem for Classical Predicate Logic The relationship between the first order models defined in terms of structures M = [M, I] and valuations s : V AR M and propositional models defined

More information

Classical Propositional Logic

Classical Propositional Logic The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,

More information

More Model Theory Notes

More Model Theory Notes More Model Theory Notes Miscellaneous information, loosely organized. 1. Kinds of Models A countable homogeneous model M is one such that, for any partial elementary map f : A M with A M finite, and any

More information

Canonical models for normal logics (Completeness via canonicity)

Canonical models for normal logics (Completeness via canonicity) 499 Modal and Temporal Logic Canonical models for normal logics (Completeness via canonicity) Marek Sergot Department of Computing Imperial College, London Autumn 2008 Further reading: B.F. Chellas, Modal

More information

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010) http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product

More information

The predicate calculus is complete

The predicate calculus is complete The predicate calculus is complete Hans Halvorson The first thing we need to do is to precisify the inference rules UI and EE. To this end, we will use A(c) to denote a sentence containing the name c,

More information

Indeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )

Indeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( ) Lebesgue Measure The idea of the Lebesgue integral is to first define a measure on subsets of R. That is, we wish to assign a number m(s to each subset S of R, representing the total length that S takes

More information

Russell s logicism. Jeff Speaks. September 26, 2007

Russell s logicism. Jeff Speaks. September 26, 2007 Russell s logicism Jeff Speaks September 26, 2007 1 Russell s definition of number............................ 2 2 The idea of reducing one theory to another.................... 4 2.1 Axioms and theories.............................

More information

arxiv: v1 [math.lo] 7 Dec 2017

arxiv: v1 [math.lo] 7 Dec 2017 CANONICAL TRUTH MERLIN CARL AND PHILIPP SCHLICHT arxiv:1712.02566v1 [math.lo] 7 Dec 2017 Abstract. We introduce and study a notion of canonical set theoretical truth, which means truth in a transitive

More information

Completeness in the Monadic Predicate Calculus. We have a system of eight rules of proof. Let's list them:

Completeness in the Monadic Predicate Calculus. We have a system of eight rules of proof. Let's list them: Completeness in the Monadic Predicate Calculus We have a system of eight rules of proof. Let's list them: PI At any stage of a derivation, you may write down a sentence φ with {φ} as its premiss set. TC

More information

Infinite Truth-Functional Logic

Infinite Truth-Functional Logic 28 Notre Dame Journal of Formal Logic Volume 29, Number 1, Winter 1988 Infinite Truth-Functional Logic THEODORE HAILPERIN What we cannot speak about [in K o or fewer propositions] we must pass over in

More information

Ahmad KARIMI A NON-SELF-REFERENTIAL PARADOX IN EPISTEMIC GAME THEORY

Ahmad KARIMI A NON-SELF-REFERENTIAL PARADOX IN EPISTEMIC GAME THEORY REPORTS ON MATHEMATICAL LOGIC 52 (2017), 45 56 doi:10.4467/20842589rm.17.002.7140 Ahmad KARIMI A NON-SELF-REFERENTIAL PARADOX IN EPISTEMIC GAME THEORY A b s t r a c t. The beliefs of other people about

More information

Some Non-Classical Approaches to the Brandenburger-Keisler Paradox

Some Non-Classical Approaches to the Brandenburger-Keisler Paradox Some Non-Classical Approaches to the Brandenburger-Keisler Paradox Can BAŞKENT The Graduate Center of the City University of New York cbaskent@gc.cuny.edu www.canbaskent.net KGB Seminar The Graduate Center

More information

Lecture 2: Syntax. January 24, 2018

Lecture 2: Syntax. January 24, 2018 Lecture 2: Syntax January 24, 2018 We now review the basic definitions of first-order logic in more detail. Recall that a language consists of a collection of symbols {P i }, each of which has some specified

More information

CSE 1400 Applied Discrete Mathematics Definitions

CSE 1400 Applied Discrete Mathematics Definitions CSE 1400 Applied Discrete Mathematics Definitions Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Arithmetic 1 Alphabets, Strings, Languages, & Words 2 Number Systems 3 Machine

More information

Constructive interpolation in hybrid logic

Constructive interpolation in hybrid logic Constructive interpolation in hybrid logic Patrick Blackburn INRIA, Lorraine patrick@aplog.org Maarten Marx Universiteit van Amsterdam marx@science.uva.nl November 11, 2002 Abstract Craig s interpolation

More information

A NOTE ON DERIVATION RULES IN MODAL LOGIC

A NOTE ON DERIVATION RULES IN MODAL LOGIC Valentin Goranko A NOTE ON DERIVATION RULES IN MODAL LOGIC The traditional Hilbert-style deductive apparatus for Modal logic in a broad sense (incl. temporal, dynamic, epistemic etc. logics) seems to have

More information