scientific article; zbMATH DE number 7533333
From MaRDI portal
Publication:5079729
Recommendations
- Absolute Provability and Safe Knowledge of Axioms
- Safety, domain independence and generalized quantification
- Computability and Definability
- Logical Approaches to Computational Barriers
- A framework for testing safety and effective computability
- scientific article; zbMATH DE number 2151710
- Abstract Computability and Invariant Definability
- Computability and totality in domains
- Computability and Incomputability
- Computability and decidability issues in the theory of consistency enforcement
Cites work
- scientific article; zbMATH DE number 1641581 (Why is no real title available?)
- scientific article; zbMATH DE number 3861143 (Why is no real title available?)
- scientific article; zbMATH DE number 53543 (Why is no real title available?)
- scientific article; zbMATH DE number 3504972 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- A Framework for Formalizing Set Theories Based on the Use of Static Set Terms
- A minimal computational theory of a minimal computational universe
- A new approach to predicative set theory
- Constructibility and decidability versus domain independence and absoluteness
- Domain-independent formulas and databases
- Formalizing Scientifically Applicable Mathematics in a Definitional Framework
- Modal languages and bounded fragments of predicate logic
- Set theory. An introduction to independence proofs
- The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas
- The fine structure of the constructible hierarchy
Cited in
(6)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079729)
