Automata, Languages and Programming
From MaRDI portal
Publication:5466549
DOI10.1007/B99859zbMath1099.03515OpenAlexW2505584480MaRDI QIDQ5466549
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
Related Items (10)
Some intuitionistic equivalents of classical principles for degree 2 formulas ⋮ Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Fluctuations, effective learnability and metastability in analysis ⋮ The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma ⋮ Refining the arithmetical hierarchy of classical principles ⋮ The Monotone Completeness Theorem in Constructive Reverse Mathematics ⋮ INTERRELATION BETWEEN WEAK FRAGMENTS OF DOUBLE NEGATION SHIFT AND RELATED PRINCIPLES ⋮ Toward the interpretation of non-constructive reasoning as non-monotonic learning ⋮ A New Translation for Semi-classical Theories — Backtracking without CPS ⋮ Mathematics based on incremental learning -- excluded middle and inductive inference
This page was built for publication: Automata, Languages and Programming
