Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard (Q6199614): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4383645785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group announcement logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of quantified announcements / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Core of a Cooperative Game Without Side Payments / rank
 
Normal rank
Property / cites work
 
Property / cites work: ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the domino problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: To be announced / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic epistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbitrary arrow update logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalition and relativised group announcement logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurring Dominoes: Making the Highly Undecidable Highly Understandable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3384080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of iterated modal relativization / 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 Modal Logic for Coalitional Power in Games / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:18, 27 August 2024

scientific article; zbMATH DE number 7810619
Language Label Description Also known as
English
Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard
scientific article; zbMATH DE number 7810619

    Statements

    Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 February 2024
    0 references
    0 references
    0 references