Range and degree of realizability of formulas in the restricted predicate calculus
- 1 January 1972
- journal article
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 5 (2) , 142-154
- https://doi.org/10.1007/bf01071084
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Impossibility of an algorithm for the decision problem in finite classesAmerican Mathematical Society Translations: Series 2, 1963
- Classes of predictably computable functionsTransactions of the American Mathematical Society, 1963
- Identity, variables, and impredicative definitionsThe Journal of Symbolic Logic, 1956
- A logical measure functionThe Journal of Symbolic Logic, 1953