Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable (Q5109226): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2781656311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Two-Variable Logic on Finite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decision Problem for Two-Variable First-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability Issues for Two-Variable Logics with Several Linear Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Variable First-Order Logic with Equivalence Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two variable first-order logic over ordered domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Variable Logic with Two Order Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-Invariance of Two-Variable Logic is Decidable / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:54, 22 July 2024

scientific article; zbMATH DE number 7198318
Language Label Description Also known as
English
Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable
scientific article; zbMATH DE number 7198318

    Statements

    Identifiers