A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic (Q266237)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic |
scientific article; zbMATH DE number 6567975
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic |
scientific article; zbMATH DE number 6567975 |
Statements
A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic (English)
0 references
13 April 2016
0 references
first-order logic
0 references
incomplete theory
0 references
finitely axiomatizable theory
0 references
model-theoretic property
0 references
Tarski-Lindenbaum algebra
0 references
c.e. Boolean algebra
0 references
Turing computability
0 references
0 references
0.8664452
0 references
0.8659278
0 references
0.8658782
0 references
0.86498505
0 references
0.8628329
0 references
0.86212724
0 references
0.8616813
0 references
0.85997826
0 references
