LEVELS OF IMPLICATION AND TYPE FREE THEORIES OF CLASSIFICATIONS WITH APPROXIMATION OPERATOR

DOI10.1002/malq.19920380109zbMath0793.03067OpenAlexW1971623432MaRDI QIDQ4295223

Andrea Cantini

Publication date: 21 August 1994

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19920380109

zbMATH Keywords

generalized recursion theorypartial classificationsasymmetric interpretationfirst-order \(\lambda\)-calculusMyhill-Flagg hierarchy of implicationstype-free framework for property theoryuntyped comprehension

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Combinatory logic and lambda calculus (03B40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (5)

Second order theories with ordinals and elementary comprehension ⋮ About Truth and Types ⋮ Extending constructive operational set theory by impredicative principles ⋮ Fixed points in Peano arithmetic with ordinals ⋮ Extending the first-order theory of combinators with self-referential truth

This page was built for publication: LEVELS OF IMPLICATION AND TYPE FREE THEORIES OF CLASSIFICATIONS WITH APPROXIMATION OPERATOR