English
Related papers

Related papers: Iterated failures of choice

200 papers

We discuss the connections between the failure of the axiom of choice in set theory, and certain model-theoretic structures with enough symmetry.

Logic · Mathematics 2019-09-02 J K Truss

Based upon the axiom of choice it is proved that the cardinality of the rational numbers is not less than the cardinality of the irrational numbers. This contradicts a main result of transfinite set theory and shows that the axiom of choice…

General Mathematics · Mathematics 2009-09-29 W. Mueckenheim

We investigate infinite sets that witness the failure of certain Ramsey-theoretic statements, such as Ramsey's or (appropriately phrased) Hindman's theorem; such sets may exist if one does not assume the Axiom of Choice. We obtain very…

Logic · Mathematics 2021-03-03 Joshua Brot , Mengyang Cao , David Fernández-Bretón

We describe the Dedekind cuts explicitly in terms of non-standard rational numbers. This leads to another construction of a Dedekind complete totally ordered field or, equivalently, to another proof of the consistency of the axioms of the…

Logic · Mathematics 2011-01-21 James F. Hall , Todor D. Todorov

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

Logic · Mathematics 2025-06-10 Slavica Mihaljevic Vlahovic , Branislav Dobrasin Vlahovic

We study the possible structures which can be carried by sets which have no countable subset, but which fail to be `surjectively Dedekind finite', in two possible senses, that there is a surjection to $\omega$, or alternatively, that there…

Logic · Mathematics 2025-09-17 Supakun Panasawatwong , J K Truss

Bishop's constructive mathematics school rejects the Law of Excluded Middle, but instead vastly makes use of weaker versions of the Choice. In this paper we pioneer an example, which shows that this road is not consistent, as our example…

Logic · Mathematics 2025-01-22 Babak Jabbar Nezhad

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

General Mathematics · Mathematics 2007-05-23 W. Mueckenheim

Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…

Combinatorics · Mathematics 2011-11-10 Terence Tao

The set-theoretic axiom WISC states that for every set there is a set of surjections to it cofinal in all such surjections. By constructing an unbounded topos over the category of sets and using an extension of the internal logic of a topos…

Category Theory · Mathematics 2015-08-27 David Michael Roberts

Different types of reasoning impose different structural demands on representational systems, yet no systematic account of these demands exists across psychology, AI, and philosophy of mind. I propose a framework identifying four structural…

Artificial Intelligence · Computer Science 2026-04-03 Yiling Wu

We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…

Logic · Mathematics 2012-01-25 Jeffry L. Hirst , Carl Mummert

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…

Logic · Mathematics 2019-03-27 David Fernández-Bretón , Elizabeth Lauri

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 look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…

Logic in Computer Science · Computer Science 2016-06-24 Ori Lahav , João Marcos , Yoni Zohar

In this extended abstract, we carefully examine a purported counterexample to a postulate of iterated belief revision. We suggest that the example is better seen as a failure to apply the theory of belief revision in sufficient detail. The…

Artificial Intelligence · Computer Science 2013-10-29 Eric Pacuit , Arthur Paul Pedersen , Jan-Willem Romeijn

While many inner model theoretic combinatorial principles are incompatible with large cardinal axioms, on some rare occasions, large cardinals actually imply that the structure of the universe of sets is analogous to the canonical inner…

Logic · Mathematics 2020-02-19 Gabriel Goldberg

We present a general framework for evaluating image counterfactuals. The power and flexibility of deep generative models make them valuable tools for learning mechanisms in structural causal models. However, their flexibility makes…

Computer Vision and Pattern Recognition · Computer Science 2023-03-03 Miguel Monteiro , Fabio De Sousa Ribeiro , Nick Pawlowski , Daniel C. Castro , Ben Glocker

Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…

Logic in Computer Science · Computer Science 2017-07-26 Ori Lahav , João Marcos , Yoni Zohar

Explaining autonomous and intelligent systems is critical in order to improve trust in their decisions. Counterfactuals have emerged as one of the most compelling forms of explanation. They address ``why not'' questions by revealing how…

Artificial Intelligence · Computer Science 2026-02-05 Leila Amgoud , Martin Cooper
‹ Prev 1 2 3 10 Next ›