Image de couverture de livre

Do not throw out the baby: Clarithmetics as alternatives to weak arithmetics

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Japaridze, Giorgi
Format:	Preprint
Publié:	2026
Sujets:	Logic in Computer Science Logic 03B47, 03B70, 03F03, 68T15 F.1.1; F.1.2; F.1.3
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A propositional cirquent calculus for computability logic
par: Japaridze, Giorgi
Publié: (2024)

Thoughts on sub-Turing interactive computability
par: Japaridze, Giorgi
Publié: (2024)

The logic of bunched implications is undecidable
par: Galatos, Nick, et autres
Publié: (2026)

Undecidability in Relevant Logic
par: Knudstorp, Søren Brinck
Publié: (2026)

A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums
par: Ramos, Arthur, et autres
Publié: (2025)

Weihrauch problems as containers
par: Pradic, Cécilia, et autres
Publié: (2025)

Reversible computations are computations
par: Aubert, Clément, et autres
Publié: (2025)

A proof complexity conjecture and the Incompleteness theorem
par: Krajicek, Jan
Publié: (2023)

A correspondence between the time and space complexity
par: Latkin, Ivan V.
Publié: (2023)

Extracting total Amb programs from proofs
par: Berger, Ulrich, et autres
Publié: (2023)

Hereditary First-Order Logic: the tractable quantifier prefix classes
par: Bodirsky, Manuel, et autres
Publié: (2024)

On the Computational Power of Extensional ESO
par: Bodirsky, Manuel, et autres
Publié: (2025)

A Logspace Constructive Proof of L=SL
par: Buss, Sam, et autres
Publié: (2025)

Complexities of Well-Quasi-Ordered Substructural Logics
par: Galatos, Nikolaos, et autres
Publié: (2025)

Formally Verifying a Transformation from MLTL Formulas to Regular Expressions
par: Wang, Zili, et autres
Publié: (2025)

Formalizing MLTL Formula Progression in Isabelle/HOL
par: Kosaian, Katherine, et autres
Publié: (2024)

Computing Distinguishing Formulae for Threshold-Based Behavioural Distances
par: Forster, Jonas, et autres
Publié: (2026)

Internal Effectful Forcing in System T
par: Escardo, Martin H., et autres
Publié: (2025)

ProofCloud: A Proof Retrieval Engine for Verified Proofs in Higher Order Logic
par: Wang, Shuai
Publié: (2024)

On the computational properties of ambivalent sets and functions
par: Normann, Dag, et autres
Publié: (2026)

A foundational characterization of Hoare Logic
par: Leivant, Daniel
Publié: (2026)

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

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
par: Tabatabai, Amirhossein Akbar, et autres
Publié: (2025)

Terminal Coalgebras and Non-wellfounded Sets in Homotopy Type Theory
par: Gylterud, Håkon Robbestad, et autres
Publié: (2020)

Propositional Dynamic Logic has Craig Interpolation: a tableau-based proof
par: Borzechowski, Manfred, et autres
Publié: (2025)

Approximate Axiomatization for Differentially-Defined Functions
par: Platzer, André, et autres
Publié: (2025)

The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
par: Rahnama, Moses
Publié: (2025)

Carryless Pairing: Additive Pairing in the Fibonacci Basis
par: Rosko, Milan
Publié: (2025)

The Golden Path to Guarded Monotone Strict NP
par: Barsukov, Alexey, et autres
Publié: (2023)

The Solver's Paradox in Formal Problem Spaces
par: Rosko, Milan
Publié: (2025)

Continuous and algebraic domains in univalent foundations
par: de Jong, Tom, et autres
Publié: (2024)

A declarative approach to specifying distributed algorithms using three-valued modal logic
par: Gabbay, Murdoch J., et autres
Publié: (2025)

A Proof-Theoretic Approach to the Semantics of Classical Linear Logic
par: Barroso-Nascimento, Victor, et autres
Publié: (2025)

Univalent Material Set Theory
par: Gylterud, Håkon Robbestad, et autres
Publié: (2023)

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
par: Anttila, Aleksi, et autres
Publié: (2025)

Computability of Initial Value Problems
par: Brattka, Vasco, et autres
Publié: (2024)

Matching logic -- a new axiomatization
par: Leuştean, Laurenţiu, et autres
Publié: (2025)

Notes on applicative matching logic
par: Leuştean, Laurenţiu
Publié: (2025)

Coalgebraic Satisfiability Checking for Arithmetic $μ$-Calculi
par: Hausmann, Daniel, et autres
Publié: (2022)

Two strong undefinability results in inquisitive and team semantics
par: Barbero, Fausto
Publié: (2024)