Model Theoretic Complexity of Automatic Structures (Extended Abstract) (Q3502675): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_45 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1487632266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reversibility of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5295697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaticity of ordinals and of homogeneous graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4451633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Pseudo-Well-Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On direct products of automaton decidable theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic linear orders and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable trees of Scott rank <i>ω</i><sub>1</sub><sup><i>CK</i></sup>, and computable approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database Theory - ICDT 2005 / rank
 
Normal rank

Latest revision as of 10:52, 28 June 2024

scientific article
Language Label Description Also known as
English
Model Theoretic Complexity of Automatic Structures (Extended Abstract)
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references