Related papers: A logic of co-valuations

Computability logic is a formal theory of computational tasks and resources. Its formulas represent interactive computational problems, logical operators stand for operations on computational problems, and validity of a formula is…

We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…

We construct a 2-equivalence $\mathfrak{CohTheory}^\text{op} \simeq \mathfrak{TypeSpaceFunc}$. Here $\mathfrak{CohTheory}$ is the 2-category of positive theories and $\mathfrak{TypeSpaceFunc}$ is the 2-category of type space functors. We…

We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and…

We report first steps towards elucidating the relationship between contextuality, measurement-based quantum computation (MBQC) and the non-classical logic of a topos associated with the computation. We show that, in a class of MBQC,…

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…

For a collection of subcategories satisfying a fixed set of conditions, for example thick subcategories of a triangulated category, we define a topological space called classifying space of subcategories. We show that this space classifies…

One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential (universal) quantifiers that leave at most one variable free. We investigate this fragment over words and trees, presenting a…

Many-valued logics in general, and fuzzy logics in particular, usually focus on a notion of consequence based on preservation of full truth, typical represented by the value 1 in the semantics given the real unit interval [0,1]. In a recent…

We consider all compatible topologies of an arbitrary finite-dimensional vector space over a non-trivial valuation field whose metric completion is a locally compact space. We construct the canonical lattice isomorphism between the lattice…

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…

The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

This thesis proposes a framework based on a notion of combinatorial cell complex (cc) whose cells are defined simply as finite sets of vertices. The cells of a cc are subject to four axioms involving a rank function that assigns a rank (or…

Quantum logic aims to capture essential quantum mechanical structure in order-theoretic terms. The Achilles' heel of quantum logic is the absence of a canonical description of composite systems, given descriptions of their components. We…

In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers. We first define the free clone T(L, C) of terms of a first order language L over a set C of…

The aim of this article is to define a notion of cardinal utility function called measurable utility and to define it on a connected and separable subset of a weakly ordered topological space. The definition is equivalent to the ones given…

We introduce and investigate a topological version of St\"ackel's 1907 characterization of finite sets, with the goal of obtaining an interesting notion that characterizes usual compactness (or a close variant of it). Define a $T_2$…

Abstraction logic is a new logic, serving as a foundation of mathematics. It combines features of both predicate logic and higher-order logic: abstraction logic can be viewed both as higher-order logic minus static types as well as…

We make three contributions. First, we formulate a discussion-graph semantics for first-order logic with equality, enabling reasoning about discussion and argumentation in AI more generally than before. This addresses the current lack of a…