English
Related papers

Related papers: The proof-theoretic strength of Constructive Secon…

200 papers

We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…

Logic · Mathematics 2022-03-14 Deacon Linkhorn

Second-order Boolean logic is a generalization of QBF, whose constant alternation fragments are known to be complete for the levels of the exponential time hierarchy. We consider two types of restriction of this logic: 1) restrictions to…

Logic in Computer Science · Computer Science 2020-07-09 Miika Hannula , Juha Kontinen , Martin Lück , Jonni Virtema

This note draws conclusions that arise by combining two recent papers, by Anuj Dawar, Erich Gr\"adel, and Wied Pakusa, published at ICALP 2019 and by Moritz Lichter, published at LICS 2021. In both papers, the main technical results rely on…

Logic in Computer Science · Computer Science 2022-09-27 Anuj Dawar , Erich Grädel , Moritz Lichter

In this paper we provide two new semantics for proofs in the constructive modal logics CK and CD. The first semantics is given by extending the syntax of combinatorial proofs for propositional intuitionistic logic, in which proofs are…

Logic in Computer Science · Computer Science 2021-04-20 Matteo Acclavio , Davide Catta , Lutz Straßburger

Two different massive gauge invariant spin-one theories in $3+1$ dimensions, one Stuckelberg formulation and the other `$B^{\wedge}F$' theory, with Kalb-Ramond field are shown to be related by duality. This is demonstrated by gauging the…

High Energy Physics - Theory · Physics 2009-10-30 E. Harikumar , M. Sivakumar

Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical,…

Quantum Physics · Physics 2014-12-31 Yoshihiro Maruyama

Whilst Power Kripke-Platek set theory, KPP, shares many properties with ordinary Kripke-Platek set theory, KP, in several ways it behaves quite differently from KP. This is perhaps most strikingly demonstrated by a result, due to Mathias,…

Logic · Mathematics 2018-01-09 Michael Rathjen

We construct equivariant $KK$-theory with coefficients in $\mathbb{R}$ and $\mathbb{R}/\mathbb{Z}$ as suitable inductive limits over ${\rm II}_1$-factors. We show that the Kasparov product, together with its usual functorial properties,…

Operator Algebras · Mathematics 2015-04-20 Paolo Antonini , Sara Azzali , Georges Skandalis

Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and…

We formulate a version of Baum-Connes' conjecture for a discrete quantum group, building on our earlier work (\cite{GK}). Given such a quantum group $\cla$, we construct a directed family $\{\cle_F \}$ of $C^*$-algebras ($F$ varying over…

K-Theory and Homology · Mathematics 2007-05-23 Debashish Goswami , A. O. Kuku

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…

Logic in Computer Science · Computer Science 2025-10-22 Tom de Jong , Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu

It is widely claimed that the natural axiom systems$\unicode{x2013}$including the large cardinal axioms$\unicode{x2013}$form a well-ordered hierarchy. Yet, as is well-known, it is possible to exhibit non-linearity and ill-foundedness by…

Logic · Mathematics 2023-12-21 Hanul Jeon , James Walsh

This paper considers two logics. The first one, $\mathbf{K}\mathsf{G}_\mathsf{inv}$, is an expansion of the G\"odel modal logic $\mathbf{K}\mathsf{G}$ with the involutive negation $\sim_\mathsf{i}$ defined as…

Logic · Mathematics 2024-01-30 Marta Bilkova , Thomas Ferguson , Daniil Kozhemiachenko

The focus of this thesis is on (1) the role of Ka\v c-Moody (KM) algebras in string theory and the development of techniques for systematically building string theory models based on higher level ($K\geq 2$) KM algebras and (2) fractional…

High Energy Physics - Theory · Physics 2008-02-03 Gerald B. Cleaver

In a previous paper, we have constructed, for an arbitrary Lie group G and any of the fields F=R or C, a good equivariant cohomology theory KF_G^*(-) on the category of proper $G$-CW-complex and have justified why it deserved the label…

Algebraic Topology · Mathematics 2010-11-02 Clément de Seguins Pazzis

We discuss some highlights of our computer-verified proof of the construction, given a countable transitive set-model $M$ of $\mathit{ZFC}$, of generic extensions satisfying $\mathit{ZFC}+\neg\mathit{CH}$ and $\mathit{ZFC}+\mathit{CH}$.…

Alain Connes and Nigel Higson pointed out in the 1990s that the Connes-Kasparov "conjecture"' for the K-theory of reduced groupe $C^\ast$-algebras seemed, in the case of reductive Lie groups, to be a cohomological echo of a conjecture of…

Operator Algebras · Mathematics 2021-03-10 Alexandre Afgoustidis

This is the second in a series of papers on the relation between algebraic set theory and predicative formal systems. In part I, we introduced the notion of a predicative category of small maps and obtained the result that such categories…

Logic · Mathematics 2008-01-16 Benno van den Berg , Ieke Moerdijk

We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…

Logic in Computer Science · Computer Science 2025-09-03 Go Hashimoto , Daniel Găină

In an impressive series of papers, Krivine showed at the edge of the last decade how classical realizability provides a surprising technique to build models for classical theories. In particular, he proved that classical realizability…

Logic in Computer Science · Computer Science 2020-07-16 Étienne Miquey