Classical logic as limit completion

DOI10.1017/S0960129504004529zbMath1068.03054OpenAlexW2020510887MaRDI QIDQ4657754

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

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

Related Items (4)

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

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