Abstract
We study probabilistic characterisation of a random model of a finite set of first order axioms. Given a set of first order axioms and a structure which we only know is a model of , we are interested in the probability that would satisfy a sentence ψ. Answering this question for all sentences in the language will give a probability distribution over the set of sentences which can be regarded as the probabilistic characterisation of the model . We investigate defining these probabilistic characterisations as the limit of probability functions imposed on the set of finite models of . We show how a symmetry axiom can uniquely specify the probability function over finite models and will study the existence of the limit in terms of the quantifier complexity of .
Original language | English |
---|---|
Article number | 102875 |
Journal | Annals of Pure and Applied Logic |
Volume | 172 |
Issue number | 1 |
Early online date | 11 Aug 2020 |
DOIs | |
Publication status | Published - 1 Jan 2021 |
Keywords
- Probabilistic models
- First order theories
- Renaming principle
- Probabilistic logic