Results 11 to 20 of about 5,644 (162)
Infinitary action logic with exponentiation [PDF]
Annals of Pure and Applied Logic, 2022 Submitted to a ...
Kuznetsov, Stepan L. +1 more
openaire +2 more sources
“Mathematics is the Logic of the Infinite”: Zermelo’s Project of Infinitary Logic
Studies in Logic, Grammar and Rhetoric, 2021 In this paper I discuss Ernst Zermelo’s ideas concerning the possibility of developing a system of infinitary logic that, in his opinion, should be suitable for mathematical inferences. The presentation of Zermelo’s ideas is accompanied with some remarks
Pogonowski Jerzy
doaj +1 more source
A Finite-Model-Theoretic View on Propositional Proof Complexity [PDF]
Logical Methods in Computer Science, 2022 We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the ...
Erich Grädel +3 more
doaj +1 more source
SMALL INFINITARY EPISTEMIC LOGICS [PDF]
The Review of Symbolic Logic, 2019 AbstractWe develop a series of small infinitary epistemic logics to study deductive inference involving intra-/interpersonal beliefs/knowledge such as common knowledge, common beliefs, and infinite regress of beliefs. Specifically, propositional epistemic logics GL (Lα) are presented for ordinalαup to a givenαo(αo≥ω) so that GL(L0) is finitary ...
Hu, Tai-Wei +2 more
openaire +4 more sources
A Coalgebraic Approach to Dualities for Neighborhood Frames [PDF]
Logical Methods in Computer Science, 2022 We develop a uniform coalgebraic approach to J\'onsson-Tarski and Thomason type dualities for various classes of neighborhood frames and neighborhood algebras.
Guram Bezhanishvili +2 more
doaj +1 more source
Indexed linear logic and higher-order model checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 In recent work, Kobayashi observed that the acceptance by an alternating tree automaton A of an infinite tree T generated by a higher-order recursion scheme G may be formulated as the typability of the recursion scheme G in an appropriate intersection ...
Charles Grellois, Paul-André Melliès
doaj +1 more source
"Rule-Following I: The Basic Issues". [PDF]
Philos CompassAbstract ‘Rule‐following’ is a name for a cluster of phenomena where we seem both guided and “normatively” constrained by something general in performing particular actions. Understanding the phenomenon is important because of its connection to meaning, representation, and content.
Reiland I.
europepmc +2 more sources
Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata [PDF]
Logical Methods in Computer Science, 2013 We present a framework for obtaining effective characterizations of simple fragments of future temporal logic (LTL) with the natural numbers as time domain.
Preugschat Sebastian, Thomas Wilke
doaj +1 more source
The Pebble-Relation Comonad in Finite Model Theory [PDF]
Logical Methods in Computer ScienceThe pebbling comonad, introduced by Abramsky, Dawar and Wang, provides a categorical interpretation for the k-pebble games from finite model theory.
Yoàv Montacute, Nihil Shah
doaj +1 more source
On Equivalence of Infinitary Formulas under the Stable Model Semantics [PDF]
, 2014 Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions
Harrison, Amelia +2 more
core +1 more source