English
Related papers

Related papers: Well-Ordered Model Universes

200 papers

We modularly build increasingly larger fragments of the ZX-calculus by modularly adding new generators and relations, at each point, giving some concrete semantics in terms of some category of spans. This is performed using Lack's technique…

Category Theory · Mathematics 2021-03-16 Cole Comfort

Let $M$ be a transitive model of $ZFC$ and let ${\bf B}$ be a $M$-complete Boolean algebra in $M.$ (In general a proper class.) We define a generalized notion of forcing with such Boolean algebras, $^*$forcing. (A $^*$ forcing extension of…

Logic · Mathematics 2016-09-06 Garvin Melles

Scaling laws play an instrumental role in the sustainable improvement in model quality. Unfortunately, recommendation models to date do not exhibit such laws similar to those observed in the domain of large language models, due to the…

The purpose of this paper is to present a general method for forcing on $\omega_2$ and $\omega_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing…

Logic · Mathematics 2026-03-16 Curial Gallart

Fast-growing hierarchies are sequences of functions obtained through various processes similar to the ones that yield multiplication from addition, exponentiation from multiplication, etc. We observe that fast-growing hierarchies can be…

Logic · Mathematics 2022-01-13 J. P. Aguilera , F. Pakhomov , A. Weiermann

We give arguments for and prove the consistency of some internal forcing axioms.

Logic · Mathematics 2009-09-25 Garvin Melles

We answer a question of Woodin by showing that assuming an inaccessible cardinal $\kappa$ which is a limit of ${<}\kappa$-supercompact cardinals exists, there is a stationary set preserving forcing $\mathbb{P}$ so that $V^{\mathbb…

Logic · Mathematics 2024-03-15 Andreas Lietz

The study of intelligent systems explains behaviour in terms of economic rationality. This results in an optimization principle involving a function or utility, which states that the system will evolve until the configuration of maximum…

Information Theory · Computer Science 2024-06-18 Pedro Hack

We show that the theory ZFC-, consisting of the usual axioms of ZFC but with the power set axiom removed-specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every…

Logic · Mathematics 2015-08-05 Victoria Gitman , Joel David Hamkins , Thomas A. Johnstone

We isolate here a wide class of well founded orders called tame orders and show that each such order of cardinality at most $\kappa$ can be realized as the Mitchell order on a measurable cardinal $\kappa$, from a consistency assumption…

Logic · Mathematics 2015-08-18 Omer Ben-Neria

We study the problem of learning efficient algorithms that strongly generalize in the framework of neural program induction. By carefully designing the input / output interfaces of the neural model and through imitation, we are able to…

Machine Learning · Computer Science 2020-07-09 Yujia Li , Felix Gimeno , Pushmeet Kohli , Oriol Vinyals

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…

Logic · Mathematics 2022-08-04 Antonio Montalbán , Dino Rossegger

We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…

Logic in Computer Science · Computer Science 2008-10-22 Alberto Momigliano , Frank Pfenning

We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for…

Logic · Mathematics 2022-10-18 Saharon Shelah

We consider a nonlinear system, affine with respect to an unbounded control $u$ which is allowed to range in a closed cone. To this system we associate a Bolza type minimum problem, with a Lagrangian having sublinear growth with respect to…

Optimization and Control · Mathematics 2019-07-11 M. Soledad Aronna , Monica Motta , Franco Rampazzo

A well ordering < of a topological space X is "left-separating" if $\{x'\in X: x'< x\}$ is closed in X for any x in X. A space is "left-separated" if it has a left-separating well-ordering. The left-separating type, $ord_l(X)$, of a…

General Topology · Mathematics 2018-06-13 Lajos Soukup , Adrienne Stanley

We study the properties of the constructible universe, L, over intuitionistic theories. We give an extended set of fundamental operations which is sufficient to generate the universe over Intuitionistic Kripke-Platek set theory without…

Logic · Mathematics 2023-09-27 Richard Matthews , Michael Rathjen

We define a class of higher inductive types that can be constructed in the category of sets under the assumptions of Zermelo-Fraenkel set theory without the axiom of choice or the existence of uncountable regular cardinals. This class…

Logic · Mathematics 2022-02-07 Andrew Swan

Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…

Logic · Mathematics 2022-01-28 Gabriel Goldberg

Modulo the existence of large cardinals, there is a model of set theory in which for some set $B$ of regular cardinals, the sequence $\langle \text{pcf}^\alpha(B): \alpha \in \text{Ord} \rangle$ is strictly increasing. The result answers a…

Logic · Mathematics 2023-04-06 Mohammad Golshani
‹ Prev 1 8 9 10 Next ›