相关论文: Flat modal fixpoint logics with the converse modal…
By iterative techniques,we present two fixed point theorems, whose modular formulations are relatively close to the Banach's fixed point theorem in the normed spaces.The first result concerns the fixed point of the strongly contraction…
We investigate under what conditions holomorphic forms defined on the regular locus of a reduced complex space extend to holomorphic (or logarithmic) forms on a resolution of singularities. We give a simple necessary and sufficient…
I explore the relationships between Prawitz's approach to non-monotonic proof-theoretic validity, which I call reducibility semantics, and some later proof-theoretic approaches, which I call standard base semantics and Sandqvist's base…
After Galvez, Martinez and Milan discovered a (Weierstrass-type) holomorphic representation formula for flat surfaces in hyperbolic 3-space, the first, third and fourth authors here gave a framework for complete flat fronts with…
The famous Banach Contraction Principle holds in complete metric spaces, but completeness is not a necessary condition -- there are incomplete metric spaces on which every contraction has a fixed point. The aim of this paper is to present…
In this paper we provide a short new proof for the integrality of Rothblum's linear description of the convex hull of incidence vectors of stable matchings in bipartite graphs. In the spirit of iterative rounding proofs, the key feature of…
Modal separability for modal fixpoint formulae is the problem to decide for two given modal fixpoint formulae $\varphi,\varphi'$ whether there is a modal formula $\psi$ that separates them, in the sense that $\varphi\models\psi$ and…
This paper introduces a model theory for resolution on Higher Order Hereditarily Harrop formulae (HOHH), the logic underlying the Lambda-Prolog programming language, and proves soundness and completeness of resolution. The semantics and the…
The computable model theory of modal logic was initiated by Suman Ganguli and Anil Nerode in [4]. They use an effective Henkin-type construction to effectivize various completeness theorems from classical modal logic. This construction has…
This paper works with preconvexlike set-valued vector optimization problems in topological linear spaces. A Fakas-Minkowski alternative theorem, a scalarization theorem, some vector saddle-point theorems and some scalar saddle point theorem…
In his fundamental work on the stack of stable n-pointed genus g curves, Finn F. Knudsen introduced the concept of a stably reflexive module in order to prove a key technical lemma. We propose an alternative definition and generalise the…
This paper develops the model theory of normal modal logics based on partial "possibilities" instead of total "worlds," following Humberstone (1981) instead of Kripke (1963). Possibility semantics can be seen as extending to modal logic the…
The classes $\mathcal D _{\mathcal Q}$ of flat relative Mittag-Leffler modules are sandwiched between the class $\mathcal F \mathcal M$ of all flat (absolute) Mittag-Leffler modules, and the class $\mathcal F$ of all flat modules. Building…
We give a new proof - not using resolution of singularities - of a formula of Denef and the second author expressing the Lefschetz number of iterates of the monodromy of a function on a smooth complex algebraic variety in terms of the Euler…
We propose to study proof search from a coinductive point of view. In this paper, we consider intuitionistic logic and a focused system based on Herbelin's LJT for the implicational fragment. We introduce a variant of lambda calculus with…
We present a streamlined and (hopefully) accessible proof of the model-completeness of the weak monadic second order version of a dense linear order with left-endpoint but no right-endpoint in a particular finite signature. We also show how…
We describe an efficient construction of a canonical non-commutative deformation of the algebraic functions on the moduli spaces of flat connections on a Riemann surface. We show that this algebra, which is a variant of the quantum moduli…
Based on the needs of convergence proofs of preconditioned proximal point methods, we introduce notions of partial strong submonotonicity and partial (metric) subregularity of set-valued maps. We study relationships between these two…
We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual…
We introduce the completeness problem for Modal Logic and examine its complexity. For a definition of completeness for formulas, given a formula of a modal logic, the completeness problem asks whether the formula is complete for that logic.…