TRUNCATION AND SEMI-DECIDABILITY NOTIONS IN APPLICATIVE THEORIES

DOI10.1017/jsl.2018.34zbMath1475.03074OpenAlexW2897679217MaRDI QIDQ4692077

Sato Kentaro, Timotej Rosebrock, Gerhard Jäger

Publication date: 26 October 2018

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jsl.2018.34

zbMATH Keywords

applicative theoriesexplicit mathematicsgraph modelabstract computabilityHausdorff-Kuratowski difference hierarchy(semi-)decidabilityKleene's second model

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Metamathematics of constructive systems (03F50) Combinatory logic and lambda calculus (03B40) Abstract and axiomatic computability and recursion theory (03D75)

Related Items

A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC, A new model construction by making a detour via intuitionistic theories. III: Ultrafinitistic proofs of conservations of \(\Sigma_1^1\) collection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructivism in mathematics. An introduction. Volume I
• Constructivism in mathematics. An introduction. Volume II
• Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
• N-strictness in applicative theories
• The limits of determinacy in second-order arithmetic
• Higher-Order Computability
• Determinacy of Wadge classes and subsystems of second order arithmetic
• REALIZABILITY SEMANTICS FOR QUANTIFIED MODAL LOGIC: GENERALIZING FLAGG’S 1985 CONSTRUCTION