Nonstandard combinatorial ultrafilters and a new local witness model
Johannes Heil, Moritz Müller
Abstract
A central object in the theory of proof complexity generators is Krajicek's local witness model. We construct a new such model as a definable ultrapower using a definable version of a selective ultrafilter over a model of arithmetic. We transfer some set theory of combinatorial ultrafilters to the definable nonstandard setting.
Create a lesson
Related papers
Internal Languages for Thin Epsilon-Hyperdoctrines: Soundness, Completeness, and Rocq Formalization
Zoltán Gábor Molnár, Csaba Tóth
A Countable Three-Generated Orthomodular Lattice with No σ-Complete Embedding
Joaquim Reizi Higuchi
Order-preserving maps of the Turing degrees: regularity and consistency strength
Liang Yu
A Nullstellensatz for the field of complex Laurent series
Pablo Cubides Kovacsics, Sebastián Uribe Rincón
Controlling The Skips of Arithmetic Sets
Taeyoung Em
Pseudofinite abelian groups and asymptotic classes of finite abelian groups
Carlos Cordoba-Caycedo, Dario Garcia