Related papers: Compactness in Constructive Mathematics via Affine…
We construct a denotational model of linear logic, whose objects are all the locally convex and separated topological vector spaces endowed with their weak topology. The negation is interpreted as the dual, linear proofs are interpreted as…
Since the introduction by Hodges, and refinement by V\"a\"an\"anen, team semantic constructions have been used to generate expressively enriched logics still conserving nice properties, such as compactness or decidability. In contrast,…
Over the years a number of topologies for the set of laws of stochastic processes have been proposed. Building on the weak topology they all aim to capture more accurately the temporal structure of the processes. In a parallel paper we show…
We introduce the concept of compact quantitative equational theory. A quantitative equational theory is defined to be compact if all its consequences are derivable by means of finite proofs. We prove that the theory of interpolative…
We first give simplified and corrected accounts of some results in \cite{PiRCP} on compactifications of pseudofinite groups. For instance, we use a classical theorem of Turing \cite{Turing} to give a simplified proof that any definable…
We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and…
We adopt the viewpoint that topological And\'e-Quillen theory for commutative $S$-algebras should provide usable (co)homology theories for doing calculations in the sense traditional within Algebraic Topology. Our main emphasis is on…
We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…
Let G be a discrete group. We give methods to compute for a generalized (co-)homology theory its values on the Borel construction (EG x X)/G of a proper G-CW-complex X satisfying certain finiteness conditions. In particular we give formulas…
A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative…
We present a unified categorical framework that connects the syntactic Henkin construction for the first-order Completeness Theorem with Lawvere's Fixed-Point Theorem. Concretely, we define two canonical functors from the category of…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
In this paper, the core convex topology on a real vector space $X$, which is constructed just by $X$ operators, is investigated. This topology, denoted by $\tau_c$, is the strongest topology which makes $X$ into a locally convex space. It…
We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…
Taking a compact K\"{a}hler manifold as playground, we explore the powerfulness of Hodge index theorem. A main object is the Lorentzian classes on a compact K\"{a}hler manifold, behind which the characterization via Lorentzian polynomials…
Our central observation is that unbounded additive recurrence establishes a homomorphism between $\mathbb{N}$ and Modus Ponens in a constructive sense. By finding sums of nonconsecutive Fibonacci indices, each inference step corresponds to…
Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…
One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable. However, different degrees of satisfiability in many-valued logics, poses various kind of…
We want to propose a new discretization ansatz for the second order Hessian complex exploiting benefits of isogeometric analysis, namely the possibility of high-order convergence and smoothness of test functions. Although our approach is…
Lindstr\"om's Theorem characterizes first order logic as the maximal logic satisfying the Compactness Theorem and the Downward L\"owenheim-Skolem Theorem. If we do not assume that logics are closed under negation, there is an obvious…