Modal Languages and Bounded Fragments of Predicate Logic

Definition des fragments modaux de la logique des predicats a partir de formules du premier ordre qui sont des traductions des proprietes poly-modales elementaires. Distinguant les fragments variables et finis des fragments lies a un quantificateur, l'A. developpe une version semantique des fragments gardes en remplacant les liens syntaxiques par des restrictions sur les types d'attribution dans les modeles generalises. Se referant a l'algebre cylindrique, l'A. indique les nouvelles directions que peuvent prendre les theoremes de Tarski dans un environnement mathematique: celle des contraintes structurelles speciales, des extensions infinies, de la logique modale etendue et d'une semantique dynamique

[1]  Ian A. Mason.  The Metatheory of the Classical Propositional Calculus is not Axiomatizable , 1985, J. Symb. Log..

[2]  Johan van Benthem,et al.  Modal Foundations for Predicate Logic , 1997, Log. J. IGPL.

[3]  Johan van Benthem,et al.  Language in action , 1991, J. Philos. Log..

[4]  A. Tarski,et al.  Cylindric Algebras. Part II , 1988 .

[5]  Roger D. Maddux,et al.  Algebraic Logic and Universal Algebra in Computer Science , 1990, Lecture Notes in Computer Science.

[6]  Kurt Schütte.  Der Interpolationssatz der intuitionistischen Prädikatenlogik , 1962 .

[7]  Jan A. Bergstra,et al.  Logic of transition systems , 1994, J. Log. Lang. Inf..

[8]  István Németi,et al.  Cylindric-relativised set algebras have strong amalgamation , 1985, Journal of Symbolic Logic.

[9]  Marcus Kracht,et al.  How Completeness and Correspondence Theory Got Married , 1993 .

[10]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[11]  M. van Lambalgen.  Natural Deduction for Generalized Quantifiers , 1996 .

[12]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[13]  A. Tarski,et al.  A Formalization Of Set Theory Without Variables , 1987 .

[14]  Lawrence S. Moss,et al.  Vicious circles - on the mathematics of non-wellfounded phenomena , 1996, CSLI lecture notes series.

[15]  Leon Henkin.  Logical systems containing only a finite number of symbols , 1966 .

[16]  Johan van Benthem,et al.  Exploring logical dynamics , 1996, Studies in logic, language and information.

[17]  Scott Weinstein,et al.  Preservation Theorems in Finite Model Theory , 1994, LCC.

[18]  A. Dawar.  Feasible computation through model theory , 1993 .

[19]  M. de Rijke,et al.  Modal Logic and Process Algebra , 1995 .

[20]  Maarten Marx,et al.  Multi-dimensional modal logic , 1997, Applied logic series.

[21]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[22]  Tinko Tinchev,et al.  Modal Environment for Boolean Speculations , 1987 .

[23]  T. Gergely,et al.  On universal algebraic constructions of logics , 1977 .

[24]  Hans Jürgen.  Semantics-Based Translation Methods for Modal Logics , 1991 .

[25]  J. Donald Monk,et al.  Nonfinitizability of Classes of Representable Cylindric Algebras , 1969, J. Symb. Log..

[26]  B. Dahn.  Admissible sets and structures , 1978 .

[27]  Daniel Gallin,et al.  Intensional and Higher-Order Modal Logic , 1975 .

[28]  J. van Benthem,et al.  Temporal logic , 1995 .

[29]  M. de Rijke.  Extending modal logic , 1993 .

[30]  J.F.A.K. van Benthem,et al.  Submodel Preservation Theorems in Finite-Variable Fragments , 1995 .

[31]  Kit Fine,et al.  Natural deduction and arbitrary objects , 1985, J. Philos. Log..

[32]  Natasha Alechina.  On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic , 1995, J. Log. Lang. Inf..

[33]  Phokion G. Kolaitis,et al.  Generalized quantifiers and pebble games on finite structures , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[34]  J. P. Thorne.  Language in Action , 1968, Nature.

[35]  Ivo Düntsch,et al.  Expressibility of properties of relations , 1995, Journal of Symbolic Logic.

[36]  Yde Venema.  Cylindric modal logic , 1993 .

[37]  Peter Øhrstrøm,et al.  Temporal Logic , 1994, Lecture Notes in Computer Science.

[38]  Don Pigozzi,et al.  Amalgamation, congruence-extension, and interpolation properties in algebras , 1971 .

[39]  Marco Hollenberg,et al.  Counting Variables in a Dynamic Setting , 1996, J. Log. Comput..

[40]  J.F.A.K. van Benthem,et al.  Modal logic and classical logic , 1983 .

[41]  István Németi,et al.  Algebraization of quantifier logics, an introductory overview , 1991, Stud Logica.

[42]  Marcus Kracht,et al.  Properties of independently axiomatizable bimodal logics , 1991, Journal of Symbolic Logic.

[43]  C. Pollard,et al.  Center for the Study of Language and Information , 2022 .

[44]  Yde Venema.  A Modal Logic for Quantification and Substitution , 1994, Log. J. IGPL.

[45]  D. Gabbay.  Expressive Functional Completeness in Tense Logic (Preliminary report) , 1981 .

[46]  István Németi,et al.  On cylindric algebraic model theory , 1990, Algebraic Logic and Universal Algebra in Computer Science.

[47]  Neil Immerman,et al.  Number of Quantifiers is Better Than Number of Tape Cells , 1981, J. Comput. Syst. Sci..

[48]  John L. Pollock,et al.  Basic modal logic , 1967, Journal of Symbolic Logic.

[49]  J. Benthem.  DYNAMIC BITS AND PIECES , 1997 .

[50]  Dov M. Gabbay,et al.  EXPRESSIVE FUNCTIONAL COMPLETENESS IN TENSE LOGIC , 1981 .

[51]  Hajnal Andréka,et al.  Complexity of Equations Valid in Algebras of Relations: Part II: Finite Axiomatizations , 1997, Ann. Pure Appl. Log..

[52]  Ian M. Hodkinson,et al.  Completeness , 2020, Mathematics of the Bond Market: A Lévy Processes Approach.

[53]  Ildikó Sain,et al.  Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic , 1988, Algebraic Logic and Universal Algebra in Computer Science.

[54]  Johan van Benthem,et al.  Back and Forth Between Modal Logic and Classical Logic , 1995, Log. J. IGPL.

[55]  Natasha Alechina,et al.  Correspondence and Completeness for Generalized Quantifiers , 1995, Log. J. IGPL.

[56]  Johan van Benthem,et al.  NNIL, A study in intuitionistic propositional logic , 1994 .

[57]  Neil Immerman,et al.  Relational queries computable in polynomial time (Extended Abstract) , 1982, STOC '82.

[58]  Roger D. Maddux.  Review: Leon Henkin, J. Donald Monk, Alfred Tarski, Cylindric Algebras. Part I; L. Henkin, J. D. Monk, A. Tarski, Cylindric Set Algebras and Related Structures; H. Andreka, I. Nemeti, On Cylindric-Relativized Set Algebras , 1985 .