Related papers: A logic of co-valuations
This is the first part of a series of articles where we are going to develop theory of valuations on manifolds generalizing the classical theory of continuous valuations on convex subsets of a linear space. In this article we still work…
We introduce prime products as a generalization of ultraproducts for positive logic. Prime products are shown to satisfy a version of {\L}o\'s's Theorem restricted to positive formulas, as well as the following variant of Keisler…
Computability theory is traditionally conceived as the theoretical basis of informatics. Nevertheless, numerous proposals transcend computability theory, in particular by emphasizing interaction of modules, or components, parts,…
We revisit a classical theme of (general or translation invariant) valuations on convex polyhedra. Our setting generalizes the classical one, in a ``dual'' direction to previously considered generalizations: while previous research was…
A cohomology theory of root systems emerges naturally in the context of Automorphic Lie Algebras, where it helps formulating some structure theory questions. In particular, one can find concrete models for an Automorphic Lie Algebra by…
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order…
We establish a novel connection between two research areas in non-classical logics which have been developed independently of each other so far: on the one hand, input/output logic, introduced within a research program developing logical…
An approach to universal (meta-)logical reasoning in classical higher-order logic is employed to explore and study simplifications of Kurt G\"odel's modal ontological argument. Some argument premises are modified, others are dropped, modal…
(Pre)closure spaces are a generalization of topological spaces covering also the notion of neighbourhood in discrete structures, widely used to model and reason about spatial aspects of distributed systems. In this paper we introduce an…
Ultraproducts are a well-known tool in the classical model theory of first-order logic. We explore their uses in the context of finite model theory.
The present article is a brief informal survey of computability logic --- the game-semantically conceived formal theory of computational resources and tasks. This relatively young nonclassical logic is a conservative extension of classical…
A formal system called cologic is proposed for the study of compacta. A counterpart of countable model theory is developed for this system, and it is applied to model theory of the pseudo-arc.
The immensely fruitful concept of Grothendieck topology or covering issued from the efforts of algebraic geometers to study "sheaf-like" objects defined on categories more general than the lattice of open sets on a topological space. In the…
Primitive recursion is a mature, well-understood topic in the theory and practice of programming. Yet its dual, primitive corecursion, is underappreciated and still seen as exotic. We aim to put them both on equal footing by giving a…
Let $\mathcal{L}$ be a first-order two-sorted language and consider a class of $\mathcal{L}$-structures of the form $\langle M, X \rangle$ where $M$ varies among structures of the first sort, while $X$ is fixed in the second sort, and it is…
Recently, we have endowed various categories of groups with topologies. The purpose of this paper is to introduce on these categories others topologies which are statistically more suitable to study well-known problems in groups theory. We…
We develop the basic model theory of local positive logic, a new logic that mixes positive logic (where negation is not allowed) and local logic (where models omit types of infinite distant pairs). We study several basic model theoretic…
The rearrangement inequality states that the sum of products of permutations of 2 sequences of real numbers are maximized when the terms are similarly ordered and minimized when the terms are ordered in opposite order. We show that similar…
We initiate the study of reducts of relational structures up to primitive positive interdefinability: After providing the tools for such a study, we apply these tools in order to obtain a classification of the reducts of the logic of…
First-order logic is typically presented as the study of deduction in a setting with elementary quantification. In this paper, we take another vantage point and conceptualize first-order logic as a linear space that encodes "plausibility".…