Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alexej P. Lisitsa / rank
Normal rank
 
Property / author
 
Property / author: Vladimir Yu. Sazonov / rank
Normal rank
 
Property / author
 
Property / author: Alexej P. Lisitsa / rank
 
Normal rank
Property / author
 
Property / author: Vladimir Yu. Sazonov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with first-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database theory - ICDT '97. 6th international conference, Delphi, Greece, January 8--10, 1997. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal deduction in second-order logic and set theory. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3817599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitary logic and inductive definability over finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4202935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-point extensions of first-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational queries computable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Delta\)-languages for sets and LOGSPACE computable graph transformers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational logic and proof theory. 5th Kurt Gödel Colloquium, KGC '97. Vienna, Austria. August 25--29, 1997. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening of the theorems on polynomial queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-well-founded sets modeled as ideal fixed points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary induction on abstract structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3743313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4207895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditarily-finite sets, data bases and polynomial-time computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395612 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:02, 29 May 2024

scientific article
Language Label Description Also known as
English
Linear ordering on graphs, anti-founded sets and polynomial time computability
scientific article

    Statements

    Linear ordering on graphs, anti-founded sets and polynomial time computability (English)
    0 references
    12 January 2000
    0 references
    0 references
    descriptive complexity
    0 references
    capturing PTIME
    0 references
    linear ordering
    0 references
    strongly extensional graphs
    0 references
    bisimulation
    0 references
    anti-foundation axiom
    0 references
    bounded set theory
    0 references
    0 references
    0 references