Results 11 to 20 of about 712,824 (175)
Computing with Infinitary Logic
Theoretical Computer Science, 1995 Most recursive extensions of the first-order queries converge around two central classes of queries: fixpoint and while. Infinitary logic (with finitely many variables) is a very powerful extension of these languages which provides an elegant unifying ...
Victor Vianu +2 more
core +4 more sources
Hybrid logics with infinitary proof systems
Journal of Logic and Computation, 2006 We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus, although these logics may be non-compact, strong completeness proofs are provided for infinitary hybrid ...
Kooi, Barteld +4 more
core +3 more sources
Chain logic and Shelah’s infinitary logic [PDF]
Israel Journal of Mathematics, 2021 This version is the final autors' version.
Džamonja, Mirna, Väänänen, Jouko
openaire +4 more sources
Infinitary action logic with exponentiation [PDF]
Annals of Pure and Applied Logic, 2022 Submitted to a ...
Stepan L. Kuznetsov +1 more
openaire +3 more sources
Internalising modified realisability in constructive type theory [PDF]
Logical Methods in Computer Science, 2005 A modified realisability interpretation of infinitary logic is formalised and proved sound in constructive type theory (CTT). The logic considered subsumes first order logic.
Erik Palmgren
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 +5 more sources
Infinitary Logic Has No Expressive Efficiency Over Finitary Logic [PDF]
, 2023 We can measure the complexity of a logical formula by counting the number of alternations between existential and universal quantifiers. Suppose that an elementary first-order formula $\varphi$ (in $\mathcal{L}_{\omega,\omega}$) is equivalent to a ...
MILES KRETSCHMER +3 more
core +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
Infinitary Classical Logic: Recursive Equations and Interactive Semantics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 In this paper, we present an interactive semantics for derivations in an infinitary extension of classical logic. The formulas of our language are possibly infinitary trees labeled by propositional variables and logical connectives.
Michele Basaldella
doaj +1 more source
Journal of Logic and Computation, 2022 AbstractWe study propositional and first-order Gödel logics over infinitary languages, which are motivated semantically by corresponding interpretations into the unit interval $[0,1]$. We provide infinitary Hilbert-style calculi for the particular (propositional and first-order) cases with con-/disjunctions of countable length and prove corresponding ...
openaire +3 more sources