English
Related papers

Related papers: Succinctness in subsystems of the spatial mu-calcu…

200 papers

Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…

Logic in Computer Science · Computer Science 2019-05-14 Lê Thành Dũng Nguyên

We show that a general miraculous cancellation formula, the divisibility of certain characteristic numbers and some other topologiclal results are con- sequences of the modular invariance of elliptic operators on loop spaces. Previously we…

High Energy Physics - Theory · Physics 2011-07-19 Kefeng Liu

We investigate some subtle and interesting phenomena in the duality theory of operator spaces and operator algebras. In particular, we give several applications of operator space theory, based on the surprising fact that certain maps are…

Operator Algebras · Mathematics 2007-05-23 David P. Blecher , Bojan Magajna

We consider a modal logic that can formalise statements about uncertainty and beliefs such as `I think that my wallet is in the drawer rather than elsewhere' or `I am confused whether my appointment is on Monday or Tuesday'. To do that, we…

Logic · Mathematics 2025-12-01 Marta Bílková , Thomas M. Ferguson , Daniil Kozhemiachenko

This paper introduces a refinement of the sequent calculus approach called cirquent calculus. While in Gentzen-style proof trees sibling (or cousin, etc.) sequents are disjoint sequences of formulas, in cirquent calculus they are permitted…

Logic · Mathematics 2011-04-15 Giorgi Japaridze

In this paper we show that if a cosimplicial space or spectrum $X^\bullet$ has a certain kind of combinatorial structure (we call it a $\Xi^n$-structure) then the total space of $X^\b$ has an action of a certain operad which is weakly…

Quantum Algebra · Mathematics 2007-05-23 James E. McClure , Jeffrey H. Smith

We stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these…

Logic in Computer Science · Computer Science 2019-03-14 Aleksy Schubert , Paweł Urzyczyn , Konrad Zdanowski

We in this paper show that omega regular languages are not closed under infinite union and intersection. As an attempt, we propose to add step variables and quantifiers to temporal logics to enhance the expressiveness of the underlying…

Formal Languages and Automata Theory · Computer Science 2016-03-18 Wanwei Liu

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…

Logic in Computer Science · Computer Science 2009-03-23 Mehrnoosh Sadrzadeh , Roy Dyckhoff

For a very general class of weighted Fock spaces on $\mathbb{C}^n$, we give necessary and sufficient conditions for a Toeplitz operator with a (not necessarily positive) measure symbol to be compact. Furthermore, we show that all compact…

Functional Analysis · Mathematics 2013-06-04 Joshua Isralowitz

This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations…

Logic in Computer Science · Computer Science 2015-07-01 François Laroussinie , Antoine Meyer , Eudes Petonnet

In this paper we consider the formally symmetric differential expression $M[\cdot]$ of any order (odd or even) $\geq 2$. We characterise the dimension of the quotient space $D(T_{\max})/D(T_{\min})$ associated with $M[\cdot]$ in terms of…

Classical Analysis and ODEs · Mathematics 2007-05-23 K V Alice , V Krishna Kumar , A Padmanabhan

We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of first-order and nonrecursive Datalog rewritings for conjunctive queries over OWL 2 QL ontologies. We use known lower…

Logic in Computer Science · Computer Science 2012-05-15 Stanislav Kikot , Roman Kontchakov , Vladimir Podolskii , Michael Zakharyaschev

We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…

Logic in Computer Science · Computer Science 2026-05-13 Sebastian Enqvist

The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…

Logic · Mathematics 2020-06-17 Laurent De Rudder , Georges Hansoul , Valentine Stetenfeld

In this paper, we present an extension of $\lambda\mu$-calculus called $\lambda\mu^{++}$-calculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on…

Logic · Mathematics 2009-05-05 Karim Nour

We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the complement of a given regular expression, a double exponential size…

Computational Complexity · Computer Science 2008-02-21 Wouter Gelade , Frank Neven

The tangled closure of a collection of subsets of a topological space is the largest subset in which each member of the collection is dense. This operation models a logical `tangle modality' connective, of significance in finite model…

Logic · Mathematics 2018-11-08 Robert Goldblatt , Ian Hodkinson

Complementable operators extend classical matrix decompositions, such as the Schur complement, to the setting of infinite-dimensional Hilbert spaces, thereby broadening their applicability in various mathematical and physical contexts. This…

Functional Analysis · Mathematics 2025-01-14 Sachin Manjunath Naik , P. Sam Johnson

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…

Logic · Mathematics 2016-11-15 Giuseppe Greco , Alessandra Palmigiano