منابع مشابه
Decidable Theories
In this lecture we work exclusively with first-order logic with equality. Fix a signature σ. A theory T is a set of sentences (closed formulas) that is closed under semantic entailment, i.e., if T |= F then F ∈ T . Given a σ-structure A it is clear that the set of sentences that hold in A is a theory. We denote this theory by Th(A) and call it the theory of A. We say that a theory is complete i...
متن کاملWhat Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
Strategy Logic (SL, for short) has been recently introduced by Mogavero, Murano, and Vardi as a formalism for reasoning explicitly about strategies, as first-order objects, in multi-agent concurrent games. This logic turns out to be very powerful, strictly subsuming all major previously studied modal logics for strategic reasoning, including ATL, ATL∗, and the like. The price that one has to pa...
متن کاملDistinguished positive regular representations
Let $G$ be a tamely ramified reductive $p$-adic group. We study distinction of a class of irreducible admissible representations of $G$ by the group of fixed points $H$ of an involution of $G$. The representations correspond to $G$-conjugacy classes of pairs $(T,phi)$, where $T$ is a tamely ramified maximal torus of $G$ and $phi$ is a quasicharacter of $T$ whose restriction t...
متن کاملSROIQsigma is decidable
Description Logics [1] are logical formalisms for representing information about classes and objects. They are very often used as the basis of knowledge representation systems and have been used recently to develop OWL semantic web language, which can be viewed as an expressive Description Logic. There is an impressive variety of Description Logics with diverse expressiveness and complexity, or...
متن کاملDecidable Higher Order Subtyping
This paper establishes the decidability of typechecking in Fω ∧ , a typed lambda calculus combining higher-order polymorphism, subtyping, and intersection types. It contains the first proof of decidability of subtyping for a higher-order system.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1995
ISSN: 0022-4049
DOI: 10.1016/0022-4049(95)00097-g