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

In this paper we make some observations concerning m-metric spaces and point out some discrepancies in the proofs found in the literature. To remedy this, we propose a new topological construction and prove that it is in fact a…

A theory of recursive and corecursive definitions has been developed in higher-order logic (HOL) and mechanized using Isabelle. Least fixedpoints express inductive data types such as strict lists; greatest fixedpoints express coinductive…

This paper outlines a general formal framework for reasoning systems, intended to support future analysis of inference architectures across domains. We model reasoning systems as structured tuples comprising phenomena, explanation space,…

We develop a finite-element technique that allows one to evaluate correction of the order of $G_Q$ to various transport characteristics of arbitrary nanostructures. Common examples of such corrections are weak localization effect on…

Fixpoint operators are tools to reason on recursive programs and data types obtained by induction (e.g. lists, trees) or coinduction (e.g. streams). They were given a categorical treatment with the notion of categories with fixpoints. A…

The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…

We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…

We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which…

We describe a mathematical structure that can give extensional denotational semantics to higher-order probabilistic programs. It is not limited to discrete probabilities, and it is compatible with integration in a way the models that have…

Attribute and size reductions are key issues in formal concept analysis. In this paper, we consider a special kind of equivalence relation to reduce concept lattices, which will be called local congruence. This equivalence relation is based…

Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…

A class of nets in constructive (in A.A.Markov's sense) topological space for which the convergence is equivalent to convergence of all subsequences, is described. B.A.Kushner's theorem about coincidence of strong and weak constructive…

We introduce the notion of syzygy for a set of reduction operators and relate it to the notion of syzygy for presentations of algebras. We give a method for constructing a linear basis of the space of syzygies for a set of reduction…

Any configuration of lattice vectors gives rise to a hierarchy of higher-dimensional configurations which generalize the Lawrence construction in geometric combinatorics. We prove finiteness results for the Markov bases, Graver bases and…

This paper provides an overview of Lawvere's Fixed-Point Theorem in category theory and aims to detail the universal framework underlying self-reference and recursive structures. First, we rigorously define fundamental concepts - such as…

Finitary/static semantics in the form of intersection type assignments have become a paradigm for analysing the fine structure of all sorts of lambda-models. The key step is the construction of a filter model isomorphic to a given…

In the study of transport in inhomogeneous systems it is common to construct transport equations invoking the inhomogeneous Fick law. The validity of this approach requires that at least two ingredients be present in the system. First,…

The notion of Intuitionistic fuzzy hypervector space has been generalized and a few basic properties on this concept are studied. It has been shown that the intersection and union of an arbitrary family of Intuitionistic fuzzy hypervector…

First-order logic is known to have limited expressive power over finite structures. It enjoys in particular the locality property, which states that first-order formulae cannot have a global view of a structure. This limitation ensures on…

This paper develops a proof-theoretic framework for abstract interpretation by systematically associating logical systems with finite abstractions. Building on earlier work on the internal logics of abstractions, we propose a general…