Cover Image

The Fractal Logic of Phi-adic Recursion

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Rosko, Milan
Format:	Preprint
Published:	2025
Subjects:	Logic Logic in Computer Science 03F07, 03B05, 03D15 (Primary) 11D04, 51M04, 68Q17 (Secondary) F.2.2; G.1.0; B.2.0; F.3.0; F.1.0
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

Remarks on Primitive Regulation
by: Rosko, Milan
Published: (2026)

Serial Properties, Selector Proofs, and the Provability of Consistency
by: Artemov, Sergei
Published: (2024)

Non-Compact Proofs
by: Artemov, Sergei
Published: (2025)

Consistency formula is strictly stronger in PA than PA-consistency
by: Artemov, Sergei
Published: (2025)

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

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

Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)

Algebraic Proof Theory for Infinitary Action Logic
by: Fussner, Wesley, et al.
Published: (2025)

Algebra of Self-Replication
by: Moss, Lawrence S.
Published: (2023)

Different Theories of Parts
by: Pietruszczak, Andrzej
Published: (2024)

A foundational characterization of Hoare Logic
by: Leivant, Daniel
Published: (2026)

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

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

Deciding subspace reachability problems with application to Skolem's Problem
by: Everett, Samuel
Published: (2024)

Provability in BI's Sequent Calculus is Decidable
by: Gheorghiu, Alexander, et al.
Published: (2021)

Why the classes P and NP are not well-defined finitarily
by: Anand, Bhupinder Singh
Published: (2024)

A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
by: Bruse, Florian, et al.
Published: (2026)

The reverse mathematics of the pigeonhole hierarchy
by: Houérou, Quentin Le, et al.
Published: (2024)

Order positive fields II
by: Korovina, Margarita, et al.
Published: (2025)

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

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
by: Anttila, Aleksi, et al.
Published: (2025)

Algorithmic correspondence and analytic rules
by: De Domenico, Andrea, et al.
Published: (2022)

Largeness notions and polytime translation for $\forall Σ^0_3$-consequences of $\mathsf{RT}^2_2$
by: Houérou, Quentin Le, et al.
Published: (2026)

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

Dilators and the reverse mathematics zoo
by: Freund, Anton
Published: (2024)

On Chaitin's Heuristic Principle and Halting Probability
by: Salehi, Saeed
Published: (2023)

The reverse mathematics of bounded Ramsey's theorem for pairs
by: Houérou, Quentin Le, et al.
Published: (2025)

The Compatibility of the Minimalist Foundation with Homotopy Type Theory
by: Contente, Michele, et al.
Published: (2022)

$Π^0_4$ conservation of the Ordered Variable Word theorem
by: Houérou, Quentin Le, et al.
Published: (2024)

$Π^0_4$ conservation of Ramsey's theorem for pairs
by: Houérou, Quentin Le, et al.
Published: (2024)

Computing Distinguishing Formulae for Threshold-Based Behavioural Distances
by: Forster, Jonas, et al.
Published: (2026)

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

Determination of the fifth Busy Beaver value
by: The bbchallenge Collaboration, et al.
Published: (2025)

A propositional cirquent calculus for computability logic
by: Japaridze, Giorgi
Published: (2024)

Do not throw out the baby: Clarithmetics as alternatives to weak arithmetics
by: Japaridze, Giorgi
Published: (2026)

Carryless Pairing: Additive Pairing in the Fibonacci Basis
by: Rosko, Milan
Published: (2025)

The finite cohesiveness principle
by: Sun, Mengzhou
Published: (2025)

The cohesive and stable Ramsey theorems and proof size over a weak base theory
by: Kołodziejczyk, Leszek Aleksander, et al.
Published: (2026)

A non-speedup result for the chain-antichain principle over a weak base theory
by: Kowalik, Katarzyna W.
Published: (2025)