English
Related papers

Related papers: Hyperclass Forcing in Morse-Kelley Class Theory

200 papers

We study the influence of strong forcing axioms on the complexity of the non-stationary ideal on $\omega_2$ and its restrictions to certain cofinalities. Our main result shows that the strengthening $MM^{++}$ of Martin's Maximum does not…

Logic · Mathematics 2022-06-06 Sean Cox , Philipp Lücke

We continue the development of the theory of construction schemes over $\omega_1$ as introduced by the third author by studying their relation with forcing axioms. Formally, we introduce the cardinals $\mathfrak{m}^n_{\mathcal{F}}$ and use…

Logic · Mathematics 2025-09-03 Jorge Antonio Cruz Chapital , Osvaldo Guzman , Stevo Todorcevic

We present a theoretical study of the compressibility, $\kappa$, in a Fermi gas with attractive contact interactions, providing predictions for the strongly-attractive regime and the superfluid phase. Our work emphasizes the compressibility…

Quantum Gases · Physics 2015-06-16 Hao Guo , Yan He , Chih-Chun Chien , K. Levin

In this paper, we introduce a translation that combines the $j$-translation with Kripke forcing in the internal logic of an elementary topos. First, we show that our translation is sound for intuitionistic first-order logic and Heyting…

Logic · Mathematics 2026-03-23 Satoshi Nakata

By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…

Logic in Computer Science · Computer Science 2009-10-28 Anthony Widjaja To , Leonid Libkin

The higher-dimensional modal mu-calculus is an extension of the mu-calculus in which formulas are interpreted in tuples of states of a labeled transition system. Every property that can be expressed in this logic can be checked in…

Logic in Computer Science · Computer Science 2012-02-17 Martin Lange , Etienne Lozes

This paper presents the Functional Machine Calculus (FMC) as a simple model of higher-order computation with "reader/writer" effects: higher-order mutable store, input/output, and probabilistic and non-deterministic computation. The FMC…

Programming Languages · Computer Science 2023-06-22 Willem Heijltjes

It was established by Jensen in 1970 that there is a generic extension $L[a]$ of the constructible universe $L$ by a real $a\not\in L$ such that $a$ is $\varDelta^1_3$ in $L[a]$. Jensen's forcing construction has found a number of…

Logic · Mathematics 2023-05-23 Vladimir Kanovei

This paper investigates the expected excess risk of in-context learning (ICL) for multiclass classification. We formalize each task as a sequence of labeled examples followed by a query input; a pretrained model then estimates the query's…

Machine Learning · Statistics 2025-09-03 Chenrui Liu , Falong Tan , Chuanlong Xie , Yicheng Zeng , Lixing Zhu

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

Logic · Mathematics 2010-12-10 Matteo Viale , Christoph Weiß

Deconstructibility is an often-used sufficient condition on a class $\mathcal{C}$ of modules that allows one to carry out homological algebra \emph{relative to $\mathcal{C}$}. The principle \textbf{Maximum Deconstructibility (MD)} asserts…

Logic · Mathematics 2025-05-23 Sean Cox

We obtain a relatively simple criterion for when a forcing has the ${<}\,\delta$-approximation property, generalizing a result of Unger. Afterwards we apply this criterion to construct variants of Mitchell Forcing in order to answer…

Logic · Mathematics 2025-08-15 Hannes Jakob

We define and study "hyperbolic forcing".

Differential Geometry · Mathematics 2016-09-21 Pedro Ontaneda

The imminent need to interpret the output of a Machine Learning model with counterfactual (CF) explanations - via small perturbations to the input - has been notable in the research community. Although the variety of CF examples is…

Machine Learning · Computer Science 2024-04-23 Kleopatra Markou , Dimitrios Tomaras , Vana Kalogeraki , Dimitrios Gunopulos

We study sheaves in the context of a duality theory for lattice structure endowed with extra operations, and in the context of forcing in a topos. Using Sheaf duality theory of Comer for cylindric algebras, we give a representation theorem…

Logic · Mathematics 2018-11-06 Trek Sayed Ahmed

The long-standing issue of the competition between the magnetic field and the Kondo effect, favoring, respectively, triplet and singlet ground states is addressed using a cluster slave-rotor mean field theory for the Hubbard model and its…

Strongly Correlated Electrons · Physics 2016-03-01 Swagata Acharya , Amal Medhi , N. S. Vidhyadhiraja , A. Taraphder

Let $F$ be a finite field. A multiset $S$ of integers is projection-forcing if for every linear function $\phi : F^n \to F^m$ whose multiset of weight changes is $S$, $\phi$ is a coordinate projection up to permutation and scaling of…

Combinatorics · Mathematics 2011-10-13 Josh Brown Kramer , Lucas Sabalka

Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed \lambda-calculus and the modal \lambda-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of…

Logic in Computer Science · Computer Science 2015-07-01 Roland Axelsson , Martin Lange , Rafal Somla

We study three regimes of the Mott transitions characterized by classical, marginally quantum and quantum. In the classical regime, the quantum degeneracy temperature is lower than the critical temperature of the Mott transition, Tc, below…

Strongly Correlated Electrons · Physics 2007-05-23 Masatoshi Imada

We discuss some highlights of our computer-verified proof of the construction, given a countable transitive set-model $M$ of $\mathit{ZFC}$, of generic extensions satisfying $\mathit{ZFC}+\neg\mathit{CH}$ and $\mathit{ZFC}+\mathit{CH}$.…