中文
相关论文

相关论文: Capturing k-ary Existential Second Order Logic wit…

200 篇论文

In this paper we study the expressive power of k-ary exclusion logic, EXC[k], that is obtained by extending first order logic with k-ary exclusion atoms. It is known that without arity bounds exclusion logic is equivalent with dependence…

逻辑 · 数学 2019-06-21 Raine Rönnholm

We study the expressive power of fragments of inclusion and independence logic defined by restricting the number k of universal quantifiers in formulas. Assuming the so-called strict semantics for these logics, we relate these fragments of…

逻辑 · 数学 2014-01-15 Miika Hannula , Juha Kontinen

We study the expressive power of fragments of inclusion and independence logic defined either by restricting the number of universal quantifiers or the arity of inclusion and independence atoms in formulas. Assuming the so-called lax…

逻辑 · 数学 2013-04-17 Pietro Galliani , Miika Hannula , Juha Kontinen

Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete…

计算机科学中的逻辑 · 计算机科学 2015-09-25 Lauri Hella , Johanna Stumpf

We study fragments of dependence logic defined either by restricting the number k of universal quantifiers or the width of dependence atoms in formulas. We find the sublogics of existential second-order logic corresponding to these…

计算机科学中的逻辑 · 计算机科学 2015-03-19 Arnaud Durand , Juha Kontinen

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…

逻辑 · 数学 2016-11-15 Giuseppe Greco , Alessandra Palmigiano

We introduce infinitary action logic with exponentiation -- that is, the multiplicative-additive Lambek calculus extended with Kleene star and with a family of subexponential modalities, which allows some of the structural rules…

计算机科学中的逻辑 · 计算机科学 2021-07-09 Stepan L. Kuznetsov , Stanislav O. Speranski

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

综合数学 · 数学 2007-05-23 Alexander Sakharov

We develop a proof-theoretic semantics (P-tS) for second-order logic (S-oL), providing an inferentialist alternative to both full and Henkin model-theoretic interpretations. Our approach is grounded in base-extension semantics (B-eS), a…

逻辑 · 数学 2025-08-12 Alexander V. Gheorghiu , David J. Pym

We show that the maximum clique problem (decision version) can be expressed in existential second order (ESO) logic, where the first order part is a Horn formula in second-order quantified predicates. Without ordering, the first order part…

计算复杂性 · 计算机科学 2010-10-05 Prabhu Manyem

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

计算机科学中的逻辑 · 计算机科学 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

Descriptive complexity theory aims at inferring a problem's computational complexity from the syntactic complexity of its description. A cornerstone of this theory is Fagin's Theorem, by which a graph property is expressible in existential…

计算机科学中的逻辑 · 计算机科学 2014-12-22 Till Tantau

We introduce some new logics of imperfect information by adding atomic formulas corresponding to inclusion and exclusion dependencies to the language of first order logic. The properties of these logics and their relationships with other…

逻辑 · 数学 2011-06-14 Pietro Galliani

In this paper we present a constructive proof of cut elimination for a system of full second order logic with the structural rules absorbed and using sets instead of sequences. The standard problem of the cutrank growth is avoided by using…

逻辑 · 数学 2016-06-22 Sandro Skansi

We provide a complete axiomatization of modal inclusion logic - team-based modal logic extended with inclusion atoms. We review and refine an expressive completeness and normal form theorem for the logic, define a natural deduction proof…

逻辑 · 数学 2025-03-13 Aleksi Anttila , Matilda Häggblom , Fan Yang

We study the expressive power of the two-variable fragment of order-invariant first-order logic. This logic departs from first-order logic in two ways: first, formulas are only allowed to quantify over two variables. Second, formulas can…

计算机科学中的逻辑 · 计算机科学 2022-07-12 Julien Grange

We study the expressive power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulation, for some finite k, are definable in modal logic extended…

计算机科学中的逻辑 · 计算机科学 2014-06-25 Lauri Hella , Kerkko Luosto , Katsuhiko Sano , Jonni Virtema

We present syntactic characterisations for the union closed fragments of existential second-order logic and of logics with team semantics. Since union closure is a semantical and undecidable property, the normal form we introduce enables…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Matthias Hoelzel , Richard Wilke

Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4. Although the method…

逻辑 · 数学 2016-06-23 Nick Bezhanishvili , Nick Galatos , Luca Spada

This paper extends implication-space semantics to include first-order quantification. Implication-space semantics has recently been introduced as an inferentialist formal semantics that can capture nonmonotonic and nontransitive material…

逻辑 · 数学 2026-02-17 Ulf Hlobil
‹ 上一页 1 2 3 10 下一页 ›