相关论文: Constructing Types in Differentially Closed Fields…

The article investigates classes of queries maintainable by conjunctive queries (CQs) and their extensions and restrictions in the dynamic complexity framework of Patnaik and Immerman. Starting from the basic language of quantifier-free…

We consider Diophantine inequalities of the kind |f(x)| \le m, where F(X) \in Z[X] is a homogeneous polynomial which can be expressed as a product of d homogeneous linear forms in n variables with complex coefficients and m\ge 1. We say…

We present a bisequent calculus (BSC) for the minimal theory of definite descriptions (DD) in the setting of neutral free logic, where formulae with non-denoting terms have no truth value. The treatment of quantifiers, atomic formulae and…

The relationship between solvability of linear diffential-algebraic equations (DAEs) and their transformability into canonical forms has been investigated for more than forty years. After a comparative analysis of numerous DAE frameworks…

A construction of fully abstract typed models for PCF and PCF^+ (i.e., PCF + "parallel conditional function"), respectively, is presented. It is based on general notions of sequential computational strategies and wittingly consistent…

Linearity and dependency analyses are key to several applications in computer science, especially, in resource management and information flow control. What connects these analyses is that both of them need to model at least two different…

We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in the propositional…

Statistically equivalent blocks are not frequently considered in the context of nonparametric two-sample hypothesis testing. Despite the limited exposure, this paper shows that a number of classical nonparametric hypothesis tests can be…

We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature. We…

Let k be an algebraically closed field, let R be an associative k-algebra, and let F = {M_a: a in I} be a family of orthogonal points in R-Mod such that End_R(M_a) = k for all a in I. Then Mod(F), the minimal full sub-category of R-Mod…

CZF is a system of set theory which, over classical logic, is equivalent to ZF, while over intuitionistic logic, it has a well-known constructive type-theoretic interpretation. This article introduces a simpler, intuitive family of…

Complex-valued harmonic functions that are univalent and sense-preserving in the open unit disk are widely studied. A new methodology is employed to construct subclasses of univalent harmonic mappings from a given subfamily of univalent…

Conceptual Scaling is a useful standard tool in Formal Concept Analysis and beyond. Its mathematical theory, as elaborated in the last chapter of the FCA monograph, still has room for improvement. As it stands, even some of the basic…

We study the set of chords of a real-valued continuous function on [0,1] with f(0)=f(1)=0. We describe which chords may appear as isolated points and provide examples illustrating our characterization. Maximal Hopf sets are introduced and…

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

The popularity of deep learning methods in the time series domain boosts interest in interpretability studies, including counterfactual (CF) methods. CF methods identify minimal changes in instances to alter the model predictions. Despite…

The model of kappa-deformed space is an interesting example of a noncommutative space, since it allows a deformed symmetry. In this paper we present new results concerning different sets of derivatives on the coordinate algebra of…

Formal Concept Analysis (FCA) is a mathematical theory based on the formalization of the notions of concept and concept hierarchies. It has been successfully applied to several Computer Science fields such as data mining,software…

Sequential testing problems involve a complex system with several components, each of which is "working" with some independent probability. The outcome of each component can be determined by performing a test, which incurs some cost. The…

Suppose $T$ is totally transcendental and every minimal non-locally-modular type is nonorthogonal to a nonisolated minimal type over the empty set. It is shown that a finite rank type $p=tp(a/A)$ is isolated if and only if $a$ is…