相关论文: Transport of finiteness structures and application…

The Theory of Functional Connections (TFC) is most often used for constraints over the field of real numbers. However, previous works have shown that it actually extends to arbitrary fields. The evidence for these claims is restricting…

The development of logic has largely been through the 'deductive' paradigm: conclusions are inferred from established premisses. However, the use of logic in the context of both human and machine reasoning is typically through the dual…

We study the finite model property of subframe logics with expressible transitive reflexive closure modality. For $m>0$, let $\mathrm{L}_m$ be the logic defined by axiom $\lozenge^{m+1} p\to \lozenge p\vee p$. We construct filtrations for…

Differential Linear Logic enriches Linear Logic with additional logical rules for the exponential connectives, dual to the usual rules of dereliction, weakening and contraction. We present a proof-net syntax for Differential Linear Logic…

In this note, we provide some categorical perspectives on the relativization construction arising from quantum measurement theory in the presence of symmetries and occupying a central place in the operational approach to quantum reference…

We investigate four model-theoretic tameness properties in the context of least fixed-point logic over a family of finite structures. We find that each of these properties depends only on the elementary (i.e., first-order) limit theory, and…

We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…

Generalized topological spaces are not necessarily closed under finite intersections. Moreover, the whole universe does not need to be open. We use modified version of this framework to establish certain models for non-normal modal logics.…

Given a class of finite models we would like to expand each model (allowing new elements but the old universe is a separate sort), making the expressive power of LFP (least fix point logic) and PFP (inductive logic) similar while not…

This text is a continuation to my former article "On Connectivity Spaces". It takes into account that connectivity spaces gives rise to phenomena which are essentially dynamic. In a first stage, the representation of finite connectivity…

The relationship between Lexical-Functional Grammar (LFG) functional structures (f-structures) for sentences and their semantic interpretations can be expressed directly in a fragment of linear logic in a way that explains correctly the…

Finite translation surfaces can be classified by the order of their singularities. When generalizing to infinite translation surfaces, however, the notion of order of a singularity is no longer well-defined and has to be replaced by new…

Linear Logic and Defeasible Logic have been adopted to formalise different features relevant to agents: consumption of resources, and reasoning with exceptions. We propose a framework to combine sub-structural features, corresponding to the…

We review two rigorous results on the transport properties of weakly interacting fermionic systems on $2d$ lattices, in the linear response regime. First, we discuss the universality of the longitudinal conductivity for interacting…

We focus on the persistence principle over weak interpretability logic. Our object of study is the logic obtained by adding the persistence principle to weak interpretability logic from several perspectives. Firstly, we prove that this…

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…

The basic notions of category theory, such as limit, adjunction, and orthogonality, all involve assertions of the existence and uniqueness of certain arrows. Weak notions arise when one drops the uniqueness requirement and asks only for…

In this Note we show that the notion of a basis of a finite-dimensional vector space could be introduced by an argument much weaker than Gauss' reduction method. Our aim is to give a short proof of a simply formulated lemma, which in fact…

In this paper we investigate the theoretical foundation of a new bottom-up semantics for linear logic programs, and more precisely for the fragment of LinLog that consists of the language LO enriched with the constant 1. We use constraints…

Tabling is a powerful resolution mechanism for logic programs that captures their least fixed point semantics more faithfully than plain Prolog. In many tabling applications, we are not interested in the set of all answers to a goal, but…