A sequent calculus for limit computable mathematics

DOI10.1016/J.APAL.2008.01.006zbMATH Open1135.03027OpenAlexW1970356442MaRDI QIDQ2482845FDOQ2482845

Authors: Stefano Berardi, Yoriyuki Yamagata 

Publication date: 24 April 2008

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.01.006

Recommendations

• scientific article; zbMATH DE number 2085171
• scientific article; zbMATH DE number 1948150
• Non-commutative infinitary Peano arithmetic
• scientific article; zbMATH DE number 1783013
• Games with 1-backtracking

zbMATH Keywords

proof theorysubstructural logicconstructive mathematicsgame semanticsclassical logiclimit computable mathematics

Mathematics Subject Classification ID

Computational learning theory (68Q32) First-order arithmetic and fragments (03F30) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Other constructive mathematics (03F65)

Cites Work

• A semantics of evidence for classical arithmetic
• Title not available (Why is that?)
• Positive Arithmetic Without Exchange Is a Subclassical Logic
• Typed Lambda Calculi and Applications

Cited In (9)

• Title not available (Why is that?)
• Games with 1-backtracking
• Limits for paraconsistent calculi
• Positive Arithmetic Without Exchange Is a Subclassical Logic
• A New Translation for Semi-classical Theories — Backtracking without CPS
• Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
• Non-Commutative First-Order Sequent Calculus
• Computer Science Logic
• Herzberger's limit rule with labelled sequent calculus

This page was built for publication: A sequent calculus for limit computable mathematics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482845)