scientific article; zbMATH DE number 7533333
From MaRDI portal
Publication:5079729
DOI10.4230/LIPICS.CSL.2018.8MaRDI QIDQ5079729FDOQ5079729
Nissan Levi, Arnon Avron, Shahar Lev
Publication date: 28 May 2022
Title of this publication is not available (Why is that?)
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
- Title not available (Why is that?)
- Domain-independent formulas and databases
- Set theory. An introduction to independence proofs
- Modal languages and bounded fragments of predicate logic
- The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas
- The fine structure of the constructible hierarchy
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructibility and decidability versus domain independence and absoluteness
- A Framework for Formalizing Set Theories Based on the Use of Static Set Terms
- A minimal computational theory of a minimal computational universe
- Title not available (Why is that?)
- Formalizing Scientifically Applicable Mathematics in a Definitional Framework
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)
