The following pages link to (Q4876410):
Displaying 8 items.
- Decidable subsets of open logic and an algorithm for R-calculus (Q2515454) (← links)
- Computational classification of cellular automata (Q2869784) (← links)
- Computability and human symbolic output (Q2987720) (← links)
- Zermelo: definiteness and the universe of definable sets (Q4470280) (← links)
- CONSERVATIVITY OF ULTRAFILTERS OVER SUBSYSTEMS OF SECOND ORDER ARITHMETIC (Q4579817) (← links)
- ZFC PROVES THAT THE CLASS OF ORDINALS IS NOT WEAKLY COMPACT FOR DEFINABLE CLASSES (Q4638982) (← links)
- Reduction games, provability and compactness (Q5055312) (← links)
- INCOMPLETENESS VIA PARADOX AND COMPLETENESS (Q5117593) (← links)