English
Related papers

Related papers: Sequential and distributive forcings without choic…

200 papers

Jech proved that every partially ordered set can be embedded into the cardinals of some model of $ZF$. We extend this result to show that every partially ordered set can be embedded into the cardinals of some model of $ZF+DC_{<\kappa}$ for…

Logic · Mathematics 2014-06-17 Asaf Karagila

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 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 show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

Logic · Mathematics 2024-05-07 Tapio Saarinen , Jouko Väänänen , William Hugh Woodin

A classical theorem of Hechler asserts that the structure $\left(\omega^\omega,\le^*\right)$ is universal in the sense that for any $\sigma$-directed poset P with no maximal element, there is a ccc forcing extension in which…

Logic · Mathematics 2020-04-21 Gabriel Fernandes , Miguel Moreno , Assaf Rinot

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

We develop a correspondence between the theory of sequential algorithms and classical reasoning, via Kreisel's no-counterexample interpretation. Our framework views realizers of the no-counterexample interpretation as dynamic processes…

Logic in Computer Science · Computer Science 2018-12-31 Thomas Powell

In this article we introduce and study hyperclass-forcing (where the conditions of the forcing notion are themselves classes) in the context of an extension of Morse-Kelley class theory, called MK$^{**}$. We define this forcing by using a…

Logic · Mathematics 2015-10-15 Carolin Antos , Sy-David Friedman

This study proposes a new efficiency requirement, a minimal almost weak Pareto principle, which says that x is socially better than y whenever the only one individual never prefers y to x, and all the others prefers x to y. Then, I show…

Theoretical Economics · Economics 2025-01-20 Norihito Sakamoto

We give a level-by-level analysis of the Weak Vop\v{e}nka Principle for definable classes of relational structures (WVP), in accordance with the complexity of their definition, and we determine the large-cardinal strength of each level.…

Logic · Mathematics 2020-12-22 Joan Bagaria , Trevor Wilson

We show that the forcing axiom for countably compact, $\omega_2$-Knaster, well-met posets is inconsistent. This is supplemental to an inconsistency result of Shelah and sets a new limit to the generalization of Martin's Axiom to the stage…

Logic · Mathematics 2020-08-05 Stevo Todorčević , Shihao Xiong

We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…

Logic in Computer Science · Computer Science 2025-09-03 Go Hashimoto , Daniel Găină

We define the $\aleph_{1.5}$ chain condition. The corresponding forcing axiom is a generalization of Martin's Axiom and implies certain uniform failures of club--guessing on $\omega_1$ that don't seem to have been considered in the…

Logic · Mathematics 2015-01-26 David Asperó , Miguel Angel Mota

We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

I investigate the relationships between three hierarchies of reflection principles for a forcing class $\Gamma$: the hierarchy of bounded forcing axioms, of $\Sigma^1_1$-absoluteness and of Aronszajn tree preservation principles. The latter…

Logic · Mathematics 2023-06-22 Gunter Fuchs

We prove a variation of Easton's lemma for strongly proper forcings, and use it to prove that, unlike the stronger principle $\textsf{IGMP}$, $\textsf{GMP}$ together with $2^\omega \le \omega_2$ is consistent with the existence of an…

Logic · Mathematics 2019-02-20 Sean Cox , John Krueger

This paper makes significant progress towards resolving a conjecture relating strong forcing axioms like $PFA$ and the derived model at a limit of Woodin cardinals $\kappa$. In particular, using a concept called Covering Matrices, we show…

Logic · Mathematics 2026-02-20 Derek Levinson , Nam Trang , Trevor Wilson

For every uncountable regular $\kappa$, we give two examples of proper posets which turn improper in some $\kappa$-closed forcing extension.

Logic · Mathematics 2019-08-06 Yasuo Yoshinobu

We study the logical structure of Teichm{\"u}ller-Tukey lemma, a maximality principle equivalent to the axiom of choice and show that it corresponds to the generalisation to arbitrary cardinals of update induction, a well-foundedness…

Logic in Computer Science · Computer Science 2024-05-17 Hugo Herbelin

We show that the notions of "strongly unfoldable cardinals", introduced by Villaveces in his model-theoretic studies of models of set theory, and "shrewd cardinals", introduced by Rathjen in a proof-theoretic context, coincide. We then…

Logic · Mathematics 2021-12-08 Philipp Lücke
‹ Prev 1 8 9 10 Next ›