Results 21 to 30 of about 712,824 (175)
Realisability for Infinitary Intuitionistic Set Theory [PDF]
, 2022 We introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). We show that our notion of OTM-realisability is sound with respect to certain systems of infinitary intuitionistic logic, and
Passmann, Robert +8 more
core +1 more source
A note on extensions of infinitary logic [PDF]
Archive for Mathematical Logic, 2004 We show that a strong form of the so called Lindstrom's Theorem fails to generalize to extensions of L_{kappa,omega} and L_{kappa,kappa}: For weakly compact kappa there is no strongest extension of L_{kappa,omega} with the (kappa,kappa)-compactness property and the Lowenheim-Skolem theorem down to kappa.
Saharon Shelah, Jouko A. Väänänen
openaire +4 more sources
Categories for infinitary logic
This is an introduction to infinitary categorical logic, focusing on first order logics with cardinal parameters for the size of contexts, conjunctions and disjunctions, and universal and existential quantification.
Bengtsson, Niclas
core +4 more sources
The Gödel-McKinsey-Tarski embedding for infinitary intuitionistic logic and its extensions
, 2023 The Gödel-McKinsey-Tarski embedding allows to view intuitionistic logic through the lenses of modal logic. In this work, an extension of the modal embedding to infinitary intuitionistic logic is introduced.
Negri, S +3 more
core +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
An Infinitary Model of Linear Logic [PDF]
, 2015 Accepted at Fossacs ...
Charles Grellois, Paul-André Melliès
openaire +3 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
Randomisation and Derandomisation in Descriptive Complexity Theory [PDF]
Logical Methods in Computer Science, 2011 We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the complexity class BPP ...
Kord Eickmeyer, Martin Grohe
doaj +1 more source
Stationary sets and infinitary logic [PDF]
Journal of Symbolic Logic, 2000 AbstractLet be the class of structures 〈λ, <, A〉, where A ⊆ λ is disjoint from a club, and let be the class of structures 〈λ, <, A), where A ⊆ λ contains a club. We prove that if λ = λ<κ is regular, then no sentence of Lλ + κ separates and On the other hand, we prove that if λ = μ+ , μ = μ<μ, and a forcing axiom holds (and if μ = ℵ0 ...
Saharon Shelah, Jouko A. Väänänen
openaire +3 more sources
Non-Commutative Infinitary Peano Arithmetic [PDF]
, 2011 Does there exist any sequent calculus such that it is a subclassical logic and it becomes classical logic when the exchange rules are added? The first contribution of this paper is answering this question for infinitary Peano arithmetic.
Berardi, Stefano, Tatsuta, Makoto
core +1 more source