Build your own clarithmetic I: Setup and completeness

Build your own clarithmetic I: Setup and completeness

Clarithmetics are number theories based on computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an algorithmic solution. Various complexity constraints...

Full description

Bibliographic Details
Main Author:	Giorgi Japaridze
Format:	Article
Language:	English
Published:	Logical Methods in Computer Science e.V. 2017-04-01
Series:	Logical Methods in Computer Science
Subjects:	computer science - logic in computer science 03f50, 03d75, 03d15, 68q10, 68t27, 68t30 f.1.1 f.1.2 f.1.3
Online Access:	https://lmcs.episciences.org/2020/pdf

Similar Items

Build your own clarithmetic II: Soundness
by: Giorgi Japaridze
Published: (2017-04-01)

Unification and Logarithmic Space
by: Clément Aubert, et al.
Published: (2018-07-01)

Unprovability of circuit upper bounds in Cook's theory PV
by: Jan Krajicek, et al.
Published: (2017-02-01)

Modal Functional (Dialectica) Interpretation
by: Dan Hernest, et al.
Published: (2021-10-01)

Inductive and Coinductive Topological Generation with Church's thesis and the Axiom of Choice
by: Maria Emilia Maietti, et al.
Published: (2022-11-01)

A limitation on the KPT interpolation
by: Jan Krajíček
Published: (2020-08-01)

On completeness and parametricity in the realizability semantics of System F
by: Paolo Pistone
Published: (2019-10-01)

Bounded degree and planar spectra
by: Anuj Dawar, et al.
Published: (2017-11-01)

Guarded and Unguarded Iteration for Generalized Processes
by: Sergey Goncharov, et al.
Published: (2019-07-01)

Encoding many-valued logic in $\lambda$-calculus
by: Fer-Jan de Vries
Published: (2021-06-01)

On the Succinctness of Atoms of Dependency
by: Martin Lück, et al.
Published: (2019-08-01)

Computability in Basic Quantum Mechanics
by: Eike Neumann, et al.
Published: (2018-06-01)

CONSISTENCY OF CIRCUIT EVALUATION, EXTENDED RESOLUTION AND TOTAL NP SEARCH PROBLEMS
by: JAN KRAJÍČEK
Published: (2016-01-01)

Typability and Type Inference in Atomic Polymorphism
by: M. Clarence Protin, et al.
Published: (2022-08-01)

Canonical Models and the Complexity of Modal Team Logic
by: Martin Lück
Published: (2019-04-01)

Functional Interpretations of Intuitionistic Linear Logic
by: Gilda Ferreira, et al.
Published: (2011-03-01)

Lineal: A linear-algebraic Lambda-calculus
by: Pablo Arrighi, et al.
Published: (2017-03-01)

Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
by: Giulio Guerrieri, et al.
Published: (2017-12-01)

Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix
by: Lê Thành Dũng Nguyên
Published: (2020-02-01)

Fusible numbers and Peano Arithmetic
by: Jeff Erickson, et al.
Published: (2022-07-01)

On the incomputability of computable dimension
by: Ludwig Staiger
Published: (2020-05-01)

Foundations of Online Structure Theory II: The Operator Approach
by: Rod Downey, et al.
Published: (2021-07-01)

W-types in setoids
by: Jacopo Emmenegger
Published: (2021-09-01)

Subcomputable Schnorr Randomness
by: Claude Sureson
Published: (2017-04-01)

Characteristic Logics for Behavioural Hemimetrics via Fuzzy Lax Extensions
by: Paul Wild, et al.
Published: (2022-06-01)

A feasible interpolation for random resolution
by: Jan Krajicek
Published: (2017-02-01)

Logical perspectives on the foundations of probability
by: Hosni Hykel, et al.
Published: (2023-06-01)

Coaxioms: flexible coinductive definitions by inference systems
by: Francesco Dagnino
Published: (2020-02-01)

Solving finite-domain linear constraints in presence of the $\texttt{alldifferent}$
by: Milan Banković
Published: (2017-04-01)

On properties of $B$-terms
by: Mirai Ikebuchi, et al.
Published: (2020-06-01)

Game characterizations and lower cones in the Weihrauch degrees
by: Hugo Nobrega, et al.
Published: (2019-08-01)

$\aleph_1$ and the modal $\mu$-calculus
by: Maria João Gouveia, et al.
Published: (2019-10-01)

Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture
by: Predrag Janičić, et al.
Published: (2019-03-01)

Functorial Fast-Growing Hierarchies
by: J. P. Aguilera, et al.
Published: (2024-01-01)

Interaction Graphs: Exponentials
by: Thomas Seiller
Published: (2019-08-01)

Notions of Anonymous Existence in Martin-L\"of Type Theory
by: Nicolai Kraus, et al.
Published: (2017-03-01)

Quantum B-algebras
by: Rump Wolfgang
Published: (2013-11-01)

An extensible equality checking algorithm for dependent type theories
by: Andrej Bauer, et al.
Published: (2022-01-01)

Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
by: Rémy Cerda, et al.
Published: (2023-12-01)

Petri Automata
by: Paul Brunet, et al.
Published: (2017-09-01)