English
Related papers

Related papers: The axiom of choice and model-theoretic structures

200 papers

We study how linear orders can be employed to realise choice functions for which the set of potential choices is restricted, i.e., the possible choice is not possible among the full powerset of all alternatives. In such restricted settings,…

Artificial Intelligence · Computer Science 2025-09-05 Kai Sauerwald , Kenneth Skiba , Eduardo Fermé , Thomas Meyer

We define and study structural properties of hypergraphs of models of a theory including lattice ones. Characterizations for the lattice properties of hypergraphs of models of a theory, as well as for structures on sets of isomorphism types…

Logic · Mathematics 2018-02-28 Beibut Kulpeshov , Sergey Sudoplatov

Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…

Artificial Intelligence · Computer Science 2018-06-05 Jasper De Bock , Gert de Cooman

In what follows, essentially two things will be accomplished: Firstly, it will be proven that a version of the Arzel\`a--Ascoli theorem and the Fr\'echet--Kolmogorov theorem are equivalent to the axiom of countable choice for subsets of…

Logic · Mathematics 2018-03-23 Adrian Fellhauer

In this paper several examples of gaps (lacunes) between dimensions of maximal and submaximal symmetric models are considered, which include investigation of number of independent linear and quadratic integrals of metrics and counting the…

Differential Geometry · Mathematics 2012-03-06 Boris Kruglikov

A model for a subject's beliefs about a phenomenon may exhibit symmetry, in the sense that it is invariant under certain transformations. On the other hand, such a belief model may be intended to represent that the subject believes or knows…

Statistics Theory · Mathematics 2008-01-15 Gert de Cooman , Enrique Miranda

We study the reverse mathematics of countable analogues of several maximality principles that are equivalent to the axiom of choice in set theory. Among these are the principle asserting that every family of sets has a $\subseteq$-maximal…

Logic · Mathematics 2010-10-01 Damir D. Dzhafarov , Carl Mummert

The replacement (or collection or choice) axiom scheme asserts bounded quantifier exchange. We prove the independence of this scheme from various weak theories of arithmetic, sometimes under a complexity assumption.

Logic in Computer Science · Computer Science 2007-05-23 Stephen Cook , Neil Thapen

An attempt is made to bring into harmony two of the paradigms commonly used in the theory of continuous distributions of defects. It is shown that the common differential geometric apparatus is provided neatly by the theory of G-structures.…

Mathematical Physics · Physics 2019-12-24 Marcelo Epstein

A classic result due to Bernstein states that in set theory with classical logic, but without the axiom of choice, for all sets $X$ and $Y$, if $X \times 2 \cong Y \times 2$ then also $X \cong Y$. We show that this cannot be done in…

Logic · Mathematics 2018-04-13 Andrew Swan

We develop a theory for describing composite objects in physics. These can be static objects, such as tables, or things that happen in spacetime (such as a region of spacetime with fields on it regarded as being composed of smaller such…

Quantum Physics · Physics 2013-03-20 Lucien Hardy

We introduce a formal theory called Flow where the intended interpretation of its terms is that of function. We prove ZF, ZFC and ZFU (ZF with atoms) can be immersed within Flow as natural consequences from our framework. Our first…

Logic · Mathematics 2021-03-31 Adonai Sant'Anna , Renato Brodzinski , Marcio de França , Otávio Bueno

We study the role of the axiom of choice and co-comprehention in second order encoding of first order predicates logic

Logic · Mathematics 2016-02-15 Fabio Pasquali

In this paper, we describe the formalization of the axiom of choice and several of its famous equivalent theorems in Morse-Kelley set theory. These theorems include Tukey's lemma, the Hausdorff maximal principle, the maximal principle,…

Logic in Computer Science · Computer Science 2019-06-11 Tianyu Sun , Wensheng Yu

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

Logic · Mathematics 2025-07-04 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty

The article introduces the concept of uniformity, which is formulated as a scheme of axioms. The connection of this concept with ordered sets is studied. The effectiveness of using axiom schemes as a convenient and short way of replacing…

Logic · Mathematics 2023-07-04 V. M. Zhuravlov

Social choice theory is a theoretical framework for analysis of combining individual preferences, interests, or welfare to reach a collective decision or social welfare in some sense. We introduce a new criterion for social choice protocols…

Multiagent Systems · Computer Science 2019-08-19 Mohammad Ali Javidian , Rasoul Ramezanian

We study consumption dependence in the context of random utility and repeated choice. We show that, in the presence of consumption dependence, the random utility model is a misspecified model of repeated rational choice. This…

Theoretical Economics · Economics 2025-10-01 Christopher Turansick

Recently, it has been argued that no extension of quantum theory can have improved predictive power under a strong assumption of free choice of the experimental settings and validity of quantum mechanics. Here, under a different free choice…

Quantum Physics · Physics 2013-04-29 GianCarlo Ghirardi , Raffaele Romano

We introduce a new formulation of the axiom of dependent choice that can be viewed as an abstract termination principle, which generalises the recursive path orderings used to establish termination of rewrite systems. We consider several…

Logic in Computer Science · Computer Science 2019-02-28 Thomas Powell