Convergence Laws for Very Sparse Random Structures with Generalized Quantifiers

Mathematical Logic Quarterly 48 (2):301-320 (2002)
  Copy   BIBTEX

Abstract

We prove convergence laws for logics of the form equation image, where equation image is a properly chosen collection of generalized quantifiers, on very sparse finite random structures. We also study probabilistic collapsing of the logics equation image, where equation image is a collection of generalized quantifiers and k ∈ ℕ+, under arbitrary probability measures of finite structures

Categories

Keywords

Reprint years

DOI

10.1002/1521-3870(200202)48:2

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Definability of Second Order Generalized Quantifiers.Juha Kontinen - 2004 - Dissertation,
Logics with Zero‐One Laws that Are Not Fragments of Bounded‐Variable Infinitary Logic.Iain A. Stewart - 1997 - Mathematical Logic Quarterly 43 (2):158-178.
Computable quantifiers and logics over finite structures.J. Makowsky & Y. Pnueli - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 313--357.
Generalized Quantifiers in Dependence Logic.Fredrik Engström - 2012 - Journal of Logic, Language and Information 21 (3):299-324.
First order predicate logic with generalized quantifiers.Per Lindström - 1966 - Theoria 32 (3):186--195.
Finite Model Theory.Heinz-Dieter Ebbinghaus & Jörg Flum - 2005 - Springer.
Henkin Quantifiers.M. Krynicki & M. Mostowski - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 193--263.
Quantifiers Definable by Second Order Means.M. Mostowski - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 181--214.
Quantifiers, some Problems and Ideas.M. Krynicki & M. Mostowski - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 1--21.
The hierarchy theorem for generalized quantifiers.Lauri Hella, Kerkko Luosto & Jouko Väänänen - 1996 - Journal of Symbolic Logic 61 (3):802-817.
Definability of polyadic lifts of generalized quantifiers.Lauri Hella, Jouko Väänänen & Dag Westerståhl - 1997 - Journal of Logic, Language and Information 6 (3):305-335.
The Hierarchy Theorem for Second Order Generalized Quantifiers.Juha Kontinen - 2006 - Journal of Symbolic Logic 71 (1):188 - 202.
Directions in Generalized Quantifier Theory.Dag Westerståhl & J. F. A. K. van Benthem - 1995 - Studia Logica 55 (3):389-419.
Modal Ontology and Generalized Quantifiers.Peter Fritz - 2013 - Journal of Philosophical Logic 42 (4):643-678.

Analytics

Added to PP
2013-12-01

Downloads
13 (#973,701)

6 months
3 (#880,460)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Infinitary logics and very sparse random graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.

Add more references