Results 31 to 40 of about 712,824 (175)

On the First-Order Complexity of Induced Subgraph Isomorphism [PDF]

Logical Methods in Computer Science, 2019
Given a graph $F$, let $I(F)$ be the class of graphs containing $F$ as an induced subgraph. Let $W[F]$ denote the minimum $k$ such that $I(F)$ is definable in $k$-variable first-order logic.
Oleg Verbitsky, Maksim Zhukovskii
doaj   +1 more source

On Bisimilarity for Quasi-discrete Closure Spaces [PDF]

Logical Methods in Computer Science
Closure spaces, a generalisation of topological spaces, have shown to be a convenient theoretical framework for spatial model checking. The closure operator of closure spaces and quasi-discrete closure spaces induces a notion of neighborhood akin to that
Vincenzo Ciancia, Diego Latella, Mieke Massink, Erik P. de Vink   +3 more
doaj   +1 more source

On the Possibility of a General Purge of Self-Reference

Análisis Filosófico, 2012
My aim in this paper is to gather some evident in favor of the view that a general purge of self-reference is possible. I do this by considering a modal-epistemic version of the Liar Paradox introduced by Roy Cook.
Lucas Rosenblatt
doaj   +1 more source

Two complete finitary sequent calculi for reflexive common knowledge

Lietuvos Matematikos Rinkinys, 2013
This paper discusses the use of complete sequent calculi for reflexive common knowledge logic. Description of language and complete infinitary calculus for RCL is presented.
Aurimas Paulius Girčys, Regimantas Pliuškevičius   +1 more
doaj   +1 more source

Infinitary logic and basically disconnected compact Hausdorff spaces

, 2018
We extend Lukasiewicz logic obtaining the infinitary logic Infinitary Riesz Logic (IRL) whose models are algebras C(X, [0, 1]), where X is a basically disconnected compact Hausdorff space.
Di Nola, Antonio, Ioana LeuŞtean, Antonio Di Nola, LEUSTEAN, IOANA GABRIELA, LAPENTA, SERAFINA, Serafina Lapenta   +5 more
core   +1 more source

Infinitary and Cyclic Proof Systems for Transitive Closure Logic [PDF]

, 2018
Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive definitions are a priori parametrized by a set of inductive definitions ...
Cohen, Liron, Rowe, Reuben N. S.
core   +1 more source

Anti-Realism and Infinitary Proofs

Análisis Filosófico, 2012
In the discussion about Yablo’s Paradox, a debated topic is the status of infinitary proofs. It is usually considered that, although a realist could (with some effort) accept them, an anti-realist could not do it at all.
Diego Tajer
doaj   +1 more source

On Some Infinitary Logics

arXiv
We define a new class of infinitary logics $\mathscr L^1_{κ,α}$ generalizing Shelah's logic $\mathbb L^1_κ$ defined in \cite{MR2869022}. If $κ=\beth_κ$ and $α<κ$ is infinite then our logic coincides with $\mathbb L^1_κ$. We study the relation between these logics for different parameters $κ$ and $α$.
Vaananen, Jouko, Velickovic, Boban
openaire   +2 more sources

A Logical Framework with Infinitary Terms

CoRR, 2023
Logical frameworks are successful in modeling proof systems. Recently, CoLF extended the logical framework LF to support higher-order rational terms that enable adequate encoding of circular objects and derivations. In this paper, we propose CoLF$^ω$ as an alternative interpretation of CoLF-style signatures where terms are taken to be all possibly ...
openaire   +3 more sources

Infinitary logic with infinite sequents: syntactic investigations [PDF]

The present paper deals with a purely syntactic analysis of infinitary logic with infinite sequents. In particular, we discuss sequent calculi for classical and intuitionistic infinitary logic with good structural properties based on sequents possibly ...
Tesi, Matteo
core   +1 more source