Classical logic as limit completion

DOI10.1017/S0960129504004529MaRDI QIDQ4657754zbMATH OpenOpenAlexFDO

Authors Stefano Berardi

Publication date 14 March 2005

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

intuitionismlimits of sequences\(\Delta^0_2\) functions

Mathematics Subject Classification ID

Classical first-order logic (03B10) Logic in computer science (03B70) Theory of numerations, effectively presented structures (03D45) First-order arithmetic and fragments (03F30) Intuitionistic mathematics (03F55)

Recommendations

• Intuitionistic completeness and classical logic
• Classical logic with partial functions
• Classical logic with partial functions
• Classically complete modal relevant logics
• Une Preuve Formelle et Intuitionniste du Théorème de Complétude de la Logique Classique
• An intuitionistic completeness theorem for classical predicate logic
• Restricted Classical Modal Logics
• Classical combinatory logic
• An intuitionistic characterization of classical logic
• Intuitionistic completeness for first order classical logic

Cited in

(4)

• A constructive analysis of learning in Peano arithmetic
• Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1
• Mathematics based on incremental learning -- excluded middle and inductive inference
• Realizability interpretation of PA by iterated limiting PCA

This page was built for publication: Classical logic as limit completion

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