相关论文: Remarks on Barr's theorem: Proofs in geometric the…
Of the great theories of classical mathematics, projective geometry, with its powerful concepts of symmetry and duality, has been exceptional in continuing to intrigue investigators. The challenge put forth by Errett Bishop (1928-1983),…
This is my habilitation thesis. As the tradition wants, I tried to give an introduction of my field of research. I post it on the ArXiv with the hope it can be useful to young researchers looking for a short and friendly text on…
We propose an interpretation of the first-order answer set programming (FOASP) in terms of intuitionistic proof theory. It is obtained by two polynomial translations between FOASP and the bounded-arity fragment of the Sigma_1 level of the…
We describe a realizability framework for classical first-order logic in which realizers live in (a model of) typed {\lambda}{\mu}-calculus. This allows a direct interpretation of classical proofs, avoiding the usual negative translation to…
If the sequent (Gamma entails forall x exists y A) is provable in first order constructive natural deduction, then the theory (Gamma, forall x (f (x)/y)A), where f is a new function symbol, is a conservative extension of Gamma.
Classically, any structure for a signature $\Sigma$ may be completed to a model of a desired regular theory $T$ by means of the chase construction or small object argument. Moreover, this exhibits $\mathrm{Mod}(T)$ as weakly reflective in…
Baer's Criterion of injectivity implies that injectivity of a module is a factorization property w.r.t. a single monomorphism. Using the notion of a cotorsion pair, we study generalizations and dualizations of factorization properties in…
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 argue that for the proof of Bell's theorem no assumptions about realism or free will are necessary. The key formula \[E(AB|a,b) = \int A(a,b,\lambda)B(a,b,\lambda)\rho(\lambda) d\lambda\] follows from the logic of plausible reasoning…
Theorems of Barth-Lefschetz type describe restrictions on the topology of varieties of small codimension. R. Schoen and J. Wolfson, using Morse theory on a path space, have described a technique to prove theorems of this kind for complex…
Euclid's reasoning is essentially constructive. Tarski's elegant and concise first-order theory of Euclidean geometry, on the other hand, is essentially non-constructive, even if we restrict attention (as we do here) to the theory with…
The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…
The Baer theorem states that for a group $G$ finiteness of $G/Z_i(G)$ implies finiteness of $\gamma_{i+1}(G)$. In this paper we show that if $G/Z(G)$ is finitely generated then the converse is true.
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…
The reconstruction theorem, a cornerstone of Martin Hairer's theory of regularity structures, appears in this article as the unique extension of the explicitly given reconstruction operator on the set of smooth models due its inherent…
We use sheaves and algebraic L-theory to construct the rational Pontryagin classes of fiber bundles with fiber R^n. This amounts to an alternative proof of Novikov's theorem on the topological invariance of the rational Pontryagin classes…
We study the basic properties of a dual "spectral" topology on positive type spaces of h-inductive theories and its essential connection to infinitary logic. The topology is Hausdorff, has the Baire property, and its compactness…
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,…
It often happens that free algebras for a given theory satisfy useful reasoning principles that are not preserved under homomorphisms of algebras, and hence need not hold in an arbitrary algebra. For instance, if $M$ is the free monoid on a…
We show that a version of L\'opez-Escobar's theorem holds in the setting of logic for metric structures. More precisely, let $\mathbb{U}$ denote the Urysohn sphere and let $\mathrm{Mod}(\mathcal{L},\mathbb{U})$ be the space of metric…