Probabilities of first-order sentences about unary functions

Type: Article

Publication Date: 1985-02-01

Citations: 39

DOI: https://doi.org/10.1090/s0002-9947-1985-0768725-2

Abstract

Let $f$ be any fixed positive integer and $\sigma$ a sentence in the first-order predicate calculus of $f$ unary functions. For positive integers $n$, an $n$-structure is a model with universe $\{ 0,1, \ldots ,n - 1\}$ and $f$ unary functions, and $\mu (n,\sigma )$ is the ratio of the number of $n$-structures satisfying $\sigma$ to ${n^{nf}}$, the number of $n$-structures. We show that ${\lim _{n \to \infty }}\mu (n,\sigma )$ exists for all such $\sigma$, and its value is given by an expression consisting of integer constants and the operators $+ , - , \cdot ,/$, and ${e^x}$.

Locations

  • Transactions of the American Mathematical Society - View - PDF

Similar Works

Action Title Year Authors
+ PDF Chat Probabilities of First-Order Sentences about Unary Functions 1985 James F. Lynch
+ First-order spectra with one binary predicate 1996 Arnaud Durand
Solomampionona Ranaivoson
+ Boolean-like and frequentistic nonstandard semantics for first-order predicate calculus without functions 2001 Ivan Kramosil
+ First Order Probabilities For Galton-Watson Trees 2015 Joel Spencer
Moumanti Podder
+ PDF Chat Limit Probabilities for Random Sparse Bit Strings 1997 Katherine St. John
+ Short monadic second order sentences about sparse random graphs 2016 Andrey Kupavskii
Maksim Zhukovskii
+ Short monadic second order sentences about sparse random graphs 2016 Andrey Kupavskii
Maksim Zhukovskii
+ Hanf Number for Scott Sentences of Computable Structures 2016 S. A. Goncharov
Julia A. Knight
Ioannis Souldatos
+ On random models of finite power and monadic logic 1985 Matt Kaufmann
Saharon Shelah
+ Hanf Number for Scott Sentences of Computable Structures 2016 小. 小. 袚芯薪褔邪褉芯胁
Julia F. Knight
Ioannis Souldatos
+ Decidable classes of number theoretic sentences. 1968 I. J. Heath
+ Decidability of the Natural Numbers with the Almost-All Quantifier 2006 David Marker
Theodore A. Slaman
+ Complexity of the first-order theory of almost all finite structures 1983 脡tienne Grandjean
+ Model Theory of Monadic Predicate Logic with the Infinity Quantifier 2018 Facundo Carreiro
Alessandro Facchini
Yde Venema
Fabio Zanasi
+ Zero-one laws for k-variable first-order logic of sparse random graphs 2018 Andriaherimanana Sarobidy Razafimahatratra
Maksim Zhukovskii
+ PDF Chat Hanf number for Scott sentences of computable structures 2018 小. 小. 袚芯薪褔邪褉芯胁
Julia F. Knight
Ioannis Souldatos
+ The Spectra of First-Order Sentences and Computational Complexity 1984 E. Grandjean
+ Multi-Structural Games and Beyond 2023 Marco Carmosino
Ronald Fagin
Neil Immerman
Phokion G. Kolaitis
Jonathan Lenchner
Rik Sengupta
+ Multi-Structural Games and Beyond 2024 Marco Carmosino
Ronald Fagin
Neil Immerman
Phokion G. Kolaitis
Jonathan Lenchner
Rik Sengupta
+ On Monadic Theories of Monadic Predicates 2010 Wolfgang Thomas