English
Related papers

Related papers: Completeness in local positive logic

200 papers

For a commutative Noetherian local ring we define and study the class of modules having reducible complexity, a class containing all modules of finite complete intersection dimension. Various properties of this class of modules are given,…

Commutative Algebra · Mathematics 2007-08-30 Petter Andreas Bergh

We study the local behavior of weak solutions, with possible singularities, of nonlocal nonlinear equations. We first prove that sets of capacity zero are removable for weak solutions under certain integrability conditions. We then…

Analysis of PDEs · Mathematics 2025-07-09 Minhyun Kim , Se-Chan Lee

We introduce simulations for modal logics with subclassical negations and restoration modalities, establish an adequacy theorem, and prove intrinsic (Hennessy-Milner-type) and relative (Van Benthem-type) characterization results. These…

Logic · Mathematics 2025-12-18 Jim de Groot , João Marcos , Rodrigo Stefanes

We extend the treatment of functional dependence, the basic concept of dependence logic, to include the possibility of dependence with a limited number of exceptions. We call this approximate dependence. The main result of the paper is a…

Logic · Mathematics 2014-08-20 Jouko Väänänen

Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…

Logic · Mathematics 2024-08-23 Jonte Deakin , Jim de Groot

The notion of analyticity is studied in the context of hypercomplex numbers. A critical review of the problems arising from the conventional approach is given. We describe a local analyticity condition which yields the desired type of…

funct-an · Mathematics 2008-02-03 Stefano De Leo , Pietro Rotelli

Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…

Logic in Computer Science · Computer Science 2019-03-27 Miika Hannula , Lauri Hella

This work focuses on the problem of exact model reduction of positive linear systems, by leveraging minimal realization theory. While determining the existence of a positive reachable realization remains in general an open problem, we are…

Systems and Control · Electrical Eng. & Systems 2025-09-18 Marco Cortese , Tommaso Grigoletto , Francesco Ticozzi , Augusto Ferrante

Several results in functional analysis are extended to the setting of $L^0$-modules, where $L^0$ denotes the ring of all measurable functions $x\colon \Omega\to \mathbb{R}$. The focus is on results involving compactness. To this end, a…

Functional Analysis · Mathematics 2017-11-28 Asgar Jamneshan , Jose Miguel Zapata

We introduce relational semantics for "flat Heyting-Lewis logic" $\mathsf{HLC}^{\flat}$. This logic arises as the extension of intuitionistic logic with a Lewis-style strict implication modality that, contrary to its "sharp" counterpart…

Logic · Mathematics 2026-03-31 Jim de Groot , Tadeusz Litak

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

Our concern is the completeness problem for spi-logics, that is, sets of implications between strictly positive formulas built from propositional variables, conjunction and modal diamond operators. Originated in logic, algebra and computer…

Logic in Computer Science · Computer Science 2026-01-21 Stanislav Kikot , Agi Kurucz , Yoshihito Tanaka , Frank Wolter , Michael Zakharyaschev

We describe a general construction of finiteness spaces which subsumes the interpretations of all positive connectors of linear logic. We then show how to apply this construction to prove the existence of least fixpoints for particular…

Logic in Computer Science · Computer Science 2016-12-15 Christine Tasson , Lionel Vaux

We generalize pp elimination for modules, or more generally abelian structures, to a continuous logic environment where the abelian structure is equipped with a homomorphism to a compact (Hausdorff) group. We conclude that the continuous…

Logic · Mathematics 2021-09-10 Nicolas Chavarria Gomez , Anand Pillay

We observe that justification logic enjoys a form the strong finite model property (sometimes also called small model property). Thus we obtain decidability proofs for justification logic that do not rely on Post's theorem.

Logic in Computer Science · Computer Science 2015-06-24 Thomas Studer

The idea of monotonicity (or positive-definiteness in the linear case) is shown to be the central theme of the solution theories associated with problems of mathematical physics. A "grand unified" setting is surveyed covering a…

Analysis of PDEs · Mathematics 2014-06-19 Rainer Picard , Sascha Trostorff , Marcus Waurick

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…

Data Structures and Algorithms · Computer Science 2024-09-25 Roberto G. Aragón , Jesús Medina , Eloísa Ramírez-Poussa

In this short note we will explore some recent connections between positivity, singularities, and boundedness in various contexts focusing on birational geometry.

Algebraic Geometry · Mathematics 2025-07-25 Caucher Birkar

We give necessary conditions for the existence of a compact manifold locally modelled on a given homogeneous space, which generalize some earlier results, in terms of relative Lie algebra cohomology. Applications include both reductive and…

Differential Geometry · Mathematics 2017-05-09 Yosuke Morita

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar