Related papers: A logic of co-valuations

We consider weighted structures, which extend ordinary relational structures by assigning weights, i.e. elements from a particular group or ring, to tuples present in the structure. We introduce an extension of first-order logic that allows…

Inquisitive logic is a research program that extends the scope of logic to cover not only statements, but also questions. In the context of this program, a logic that plays a prominent role is inquisitive first-order logic, InqBQ, which…

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…

We study topology, particularly compactness, as an extension of Shulman's work on constructive mathematics via affine logic, while allowing propositional impredicativity. We introduce a notion of compactness in affine logic and prove the…

We already saw in [A1] that the space of dynamically marked rational maps can be identified to a subspace of the space of covers between trees of spheres on which there is a notion of convergence that makes it sequentially compact. In the…

This note tries to show that a re-examination of a first course in analysis, using the more sophisticated tools and approaches obtained in later stages, can be a real fun for experts, advanced students, etc. We start by going to the…

From a group action on a space, define a variant of the configuration space by insisting that no two points inhabit the same orbit. When the action is almost free, this "orbit configuration space" is the complement of an arrangement of…

This article is the second part in the series of articles where we are developing theory of valuations on manifolds. Roughly speaking valuations could be thought as finitely additive measures on a class of nice subsets of a manifold which…

It is the goal of this article to extend the notion of quantization from the standard interpretation focused on non-commuting observables defined starting from classical analogues, to the topological equivalents defined in terms of…

Up to equivalence, a substitution in propositional logic is an endomorphism of its free algebra. On the dual space, this results in a continuous function, and whenever the space carries a natural measure one may ask about the stochastic…

Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…

Subobject independence as morphism co-possibility has recently been defined in [2] and studied in the context of algebraic quantum field theory. This notion of independence is handy when it comes to systems coming from physics, but when…

The concept of a clone is central to many branches of mathematics, such as universal algebra, algebraic logic, and lambda calculus. Abstractly a clone is a category with two objects such that one is a countably infinite power of the other.…

The topos approach to the formulation of physical theories includes a new form of quantum logic. We present this topos quantum logic, including some new results, and compare it to standard quantum logic, all with an eye to conceptual…

In this paper we define the coarse (co)homology of the complement of a subspace in a metric space, generalizing the coarse (co)homology of Roe. We give a model space which encodes coarse geometric structure of the complement. We also…

Based on the ideas of quantum theory of open systems (QTOS) we propose the consistent approach to study probabilistic many-valued propositional logic of intelligent devices that are composed from separate but interconnected logical units.…

We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain which can be compared wrt. equality. As the satisfiability problem for this logic is undecidable in general, in…

Our aim is to solve a quite old question on the difference between expandability and compact expandability. Toward this, we further investigate the logic of countable cofinality.

In the last years complex networks tools contributed to provide insights on the structure of research, through the study of collaboration, citation and co-occurrence networks. The network approach focuses on pairwise relationships, often…