Cover Image

Punctually Standard and Nonstandard Models of Natural Numbers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bazhenov, Nikolay, Georgiev, Ivan, Kalociński, Dariusz, Vatev, Stefan, Wrocławski, Michał
Format:	Preprint
Published:	2026
Subjects:	Logic Computational Complexity 03D20 (Primary), 03C57 (Secondary) F.1.1; F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Lopez-Escobar Theorem for Continuous Domains
by: Bazhenov, Nikolay, et al.
Published: (2023)

Learning Families of Algebraic Structures from Text
by: Bazhenov, Nikolay, et al.
Published: (2024)

Online and feasible presentability: from trees to modal algebras
by: Bazhenov, Nikolay, et al.
Published: (2025)

Loops, Inverse Limits and Non-Determinism
by: Brattka, Vasco
Published: (2025)

Proof complexity of universal algebra in a CSP dichotomy proof
by: Gaysin, Azza
Published: (2024)

The Aurellion Function: A Recursive Fast-Growing Hierarchy Beyond Knuth Notation
by: Vodrazka, Daniel
Published: (2025)

On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)

On the computational properties of ambivalent sets and functions
by: Normann, Dag, et al.
Published: (2026)

Extended Nullstellensatz proof systems
by: Krajicek, Jan
Published: (2023)

Finitary Simulation of Infinitary $β$-Reduction via Taylor Expansion, and Applications
by: Cerda, Rémy, et al.
Published: (2022)

Univalent Material Set Theory
by: Gylterud, Håkon Robbestad, et al.
Published: (2023)

Failure Modes for Structural Highness Notions
by: Calvert, Wesley, et al.
Published: (2025)

A correspondence between the time and space complexity
by: Latkin, Ivan V.
Published: (2023)

Terminal Coalgebras and Non-wellfounded Sets in Homotopy Type Theory
by: Gylterud, Håkon Robbestad, et al.
Published: (2020)

Forcing as a Local Method of Accessing Small Extensions
by: Lau, Desmond
Published: (2024)

Computability of the Hahn-Banach Theorem Revisited
by: Brattka, Vasco, et al.
Published: (2026)

The Solver's Paradox in Formal Problem Spaces
by: Rosko, Milan
Published: (2025)

Undecidability in Relevant Logic
by: Knudstorp, Søren Brinck
Published: (2026)

Exploring the abyss in Kleene's computability theory
by: Sanders, Sam
Published: (2023)

On some computational properties of open sets
by: Normann, Dag, et al.
Published: (2024)

Relative Constructibility via Generalised Sequential Algorithms
by: Lau, Desmond
Published: (2024)

Consistent ultrafinitist logic
by: Gajda, Michał J.
Published: (2021)

Agent Interpolation for Knowledge
by: Bílková, Marta, et al.
Published: (2025)

Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)

Forcing with Language Fragments, Extending Namba Forcing, and Models of Theories with Constraints in Interpretation
by: Lau, Desmond
Published: (2024)

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2025)

Strongly First Order Disjunctive Embedded Dependencies in Team Semantics
by: Galliani, Pietro
Published: (2025)

Verified Program Extraction in Number Theory: The Fundamental Theorem of Arithmetic and Relatives
by: Wiesnet, Franziskus
Published: (2025)

Glivenko's theorems from an ecumenical perspective
by: Pereira, Luiz Carlos, et al.
Published: (2026)

Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras
by: Forster, Jonas, et al.
Published: (2023)

Continuations and Completeness in Proof-theoretic Semantics
by: Gu, Tao, et al.
Published: (2026)

What If Turing Had Preceded Gödel?
by: Oberhoff, Sebastian
Published: (2024)

On the Realizability of Prime Conjectures in Heyting Arithmetic
by: Rosko, Milan
Published: (2025)

A Theory for Probabilistic Polynomial-Time Reasoning
by: Chen, Lijie, et al.
Published: (2026)

Proof Compression via Subatomic Logic and Guarded Substitutions
by: Barrett, Victoria, et al.
Published: (2025)

On Some Complexity Results for Even Linear Languages
by: Cojocaru, Liliana
Published: (2024)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)

Simply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic
by: Walsh, Sean
Published: (2024)

Computability of Initial Value Problems
by: Brattka, Vasco, et al.
Published: (2024)

On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic
by: Bacik, Piotr, et al.
Published: (2026)