\(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation (Q1893143): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Quantifier elimination for infinite terms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4271920 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new method for undecidability proofs of first order theories / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decidability of the existential theory of infinite terms with subterm relation / rank | |||
Normal rank | |||
Latest revision as of 15:08, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation |
scientific article |
Statements
\(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation (English)
0 references
28 September 1995
0 references
labeled trees
0 references
infinite terms
0 references
subtree relation
0 references
existential theory
0 references
