English
Related papers

Related papers: New inner models from second order logics

200 papers

We define the notion of a model of higher-order modal logic in an arbitrary elementary topos $\mathcal{E}$. In contrast to the well-known interpretation of (non-modal) higher-order logic, the type of propositions is not interpreted by the…

Logic · Mathematics 2017-03-07 Steve Awodey , Kohei Kishida , Hans-Christoph Kotzsch

Much of the theory of large cardinals beyond a measurable cardinal concerns the structure of elementary embeddings of the universe of sets into inner models. This paper seeks to answer the question of whether the inner model uniquely…

Logic · Mathematics 2025-02-05 Gabriel Goldberg

This paper studies structural consequences of supercompactness of $\omega_1$ under $\sf{ZF}$. We show that the Axiom of Dependent Choice $(\sf{DC})$ follows from "$\omega_1$ is supercompact". "$\omega_1$ is supercompact" also implies that…

Logic · Mathematics 2019-04-04 Daisuke Ikegami , Nam Trang

The logic L^1_\theta introduced in [Sh:797]; it is the maximal logic below L_theta theta in which a well ordering is not definable. We investigate it for theta a compact cardinal. We prove it satisfies several parallel of classical theorems…

Logic · Mathematics 2021-08-10 Saharon Shelah

In this article we prove three main theorems: (1) guessing models are internally unbounded, (2) for any regular cardinal $\kappa \ge \omega_2$, $\textsf{ISP}(\kappa)$ implies that $\textsf{SCH}$ holds above $\kappa$, and (3) forcing posets…

Logic · Mathematics 2019-07-23 John Krueger

We consider two-variable first-order logic FO2 over infinite words. Restricting the number of nested negations defines an infinite hierarchy; its levels are often called the half-levels of the FO2 quantifier alternation hierarchy. For every…

Formal Languages and Automata Theory · Computer Science 2020-12-03 Viktor Henriksson , Manfred Kufleitner

Assuming the P-ideal dichotomy, we attempt to isolate those cardinal characteristics of the continuum that are correlated with two well-known consequences of the proper forcing axiom. We find a cardinal invariant $\mathfrak{x}$ such that…

Logic · Mathematics 2013-05-27 Dilip Raghavan , Stevo Todorcevic

A cardinal is weakly Reinhardt if it is the critical point of an elementary embedding from the universe of sets into a model that contains the double powerset of every ordinal. This note establishes the equiconsistency of a proper class of…

Logic · Mathematics 2021-07-29 Gabriel Goldberg

We produce a model where every supercompact cardinal is $C^{(1)}$-supercompact with inaccessible targets. This is a significant improvement of the main identity-crises configuration obtained in \cite{HMP} and provides a definitive answer to…

Logic · Mathematics 2024-06-19 Alejandro Poveda

We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we…

Logic · Mathematics 2019-12-03 Matteo Viale

We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…

Logic in Computer Science · Computer Science 2021-05-14 Dominik D. Freydenberger , Liat Peterfreund

We study two extensions of FO2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, "the letter $a$ appears between…

Logic in Computer Science · Computer Science 2023-06-22 Andreas Krebs , Kamal Lodaya , Paritosh K. Pandya , Howard Straubing

Recently, FO(C), the integration of C-Log with classical logic, was introduced as a knowledge representation language. Up to this point, no systems exist that perform inference on FO(C), and very little is known about properties of…

Logic in Computer Science · Computer Science 2014-04-28 Bart Bogaerts , Joost Vennekens , Marc Denecker , Jan Van den Bussche

In the 1990s, Steel and Woodin showed that under large cardinal hypotheses, the HOD of $L(\mathbb R)$ admits a fine-structural analysis. Although this theorem sheds light on various problems in descriptive set theory, the fine-structural…

Logic · Mathematics 2026-03-24 Gabriel Goldberg , Grigor Sargsyan , Benjamin Siskind

We consider the family of guarded and unguarded ordered logics, that constitute a recently rediscovered family of decidable fragments of first-order logic (FO), in which the order of quantification of variables coincides with the order in…

Logic in Computer Science · Computer Science 2022-06-24 Bartosz Bednarczyk , Reijo Jaakkola

We show that the analogues of the Hamkins embedding theorems, proved for the countable models of set theory, do not hold when extended to the uncountable realm of $\omega_1$-like models of set theory. Specifically, under the $\diamondsuit$…

Logic · Mathematics 2015-01-07 Gunter Fuchs , Victoria Gitman , Joel David Hamkins

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…

Logic · Mathematics 2023-07-06 Christopher J. Eagle , Clovis Hamel , Sandra Müller , Franklin D. Tall

We discuss the connection between various orders on the class of all the ultrafilters and certain compactness properties of abstract logics and of topological spaces. We present a model theoretical characterization of Comfort order. We…

Logic · Mathematics 2010-05-17 Paolo Lipparini

We study the relations between a generalization of pseudocompactness, named $(\kappa, M)$-pseudocompactness, the countably compactness of subspaces of $\beta \omega$ and the pseudocompactness of their hyperspaces. We show, by assuming the…

General Topology · Mathematics 2019-04-15 Y. F. Ortiz-Castillo , V. O. Rodrigues , A. H. Tomita

We give an example of a countable theory T such that for every cardinal lambda >= aleph_2 there is a fully indiscernible set A of power lambda such that the principal types are dense over A, yet there is no atomic model of T over A. In…

Logic · Mathematics 2008-02-03 Michael C. Laskowski , Saharon Shelah