Frege's Begriffsschrift is Indeed First-Order Complete
نویسندگان
چکیده
منابع مشابه
ATL Satisfiability is Indeed EXPTIME-complete
The alternating-time temporal logic (ATL) of Alur, Henzinger and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems and game-like multi-agent systems. In this article, we investigate the computational complexity of the satisfiability problem for ATL. For the case where the set of agents is fixed in advance, this problem was settled a...
متن کاملModel Checking Abilities under Incomplete Information Is Indeed Delta2-complete
We study the model checking complexity of Alternating-time temporal logic with imperfect information and imperfect recall (atlir). Contrary to what we have stated in [11], the problem turns out to be∆2 -complete, thus con rming the initial intuition of Schobbens [18]. We prove ∆2 -hardness through a reduction of the SNSAT problem, while the membership in∆ P 2 stems from the algorithm presented ...
متن کاملModel Checking Abilities under Incomplete Information Is Indeed ∆ P 2 - complete Wojciech Jamroga and Jürgen Dix
We study the model checking complexity of Alternating-time temporal logic with imperfect information and imperfect recall (ATLir). Contrary to what we have stated in [10], the problem turns out to be ∆2 -complete, thus confirming the initial intuition of Schobbens. We prove the∆2 -hardness through a reduction of the SNSAT problem, while the membership in ∆2 stems from the algorithm presented in...
متن کاملWhat, Indeed, Is Intransitive Noninterference?
This paper argues that Haigh and Young’s definition of noninterference for intransitive security policies admits information flows that are not in accordance with the intuitions it seeks to formalise. Several alternative definitions are discussed, which are shown to be equivalent to the classical definition of noninterference with respect to transitive policies. Rushby’s unwinding conditions fo...
متن کاملApery's Double Sum is Plain Sailing Indeed
We demonstrate that also the second sum involved in Apéry’s proof of the irrationality of ζ(3) becomes trivial by symbolic summation. In his beautiful survey [4], van der Poorten explained that Apéry’s proof [1] of the irrationality of ζ(3) relies on the following fact: If a(n) = n
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: History and Philosophy of Logic
سال: 2017
ISSN: 0144-5340,1464-5149
DOI: 10.1080/01445340.2017.1350549