Cargando…
Deciding Simple Infinity Axiom Sets with One Binary Relation by Means of Superpostulates
Modern logic engines widely fail to decide axiom sets that are satisfiable only in an infinite domain. This paper specifies an algorithm that automatically generates a database of independent infinity axiom sets with fewer than 1000 characters. It starts with complete theories of pure first-order lo...
Autores principales: | Lampert, Timm, Nakano, Anderson |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7324131/ http://dx.doi.org/10.1007/978-3-030-51074-9_12 |
Ejemplares similares
-
What’s Decidable About Program Verification Modulo Axioms?
por: Mathur, Umang, et al.
Publicado: (2020) -
The consistency of the axiom of choice and of the generalized continuum-hypothesis with the axioms of set theory
por: Gödel, Kurt
Publicado: (1940) -
Numbers, sets and axioms : the apparatus of mathematics
por: Hamilton, A. G., 1943-
Publicado: (1982) -
The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal
por: Woodin, W Hugh
Publicado: (2010) -
Axioms and hulls
por: Knuth, Donald Ervin
Publicado: (1992)