English
Related papers

Related papers: Lewisian Fixed Points I: Two Incomparable Construc…

200 papers

This paper presents a systematic study of the prehistory of the traditional subsystems of second-order arithmetic that feature prominently in the reverse mathematics program of Friedman and Simpson. We look in particular at: (i) the long…

History and Overview · Mathematics 2016-12-20 Walter Dean , Sean Walsh

We consider mappings, which are structure consisting of a single function (and possibly some number of unary relations) and address the problem of approximating a continuous mapping by a finite mapping. This problem is the inverse problem…

Combinatorics · Mathematics 2018-05-15 Jaroslav Nesetril , Patrice Ossona de Mendez

Using an elementary argument, we prove new fixed point theorems for classical elliptic complexes. We obtain new results for conformal relations and coisotropic intersections. We obtain theorems for the average intersections of families of…

Differential Geometry · Mathematics 2007-05-23 Mark Stern

In this paper, we introduce the new concepts of subcompatibility and subsequential continuity which are respectively weaker than occasionally weak compatibilty and reciprocal continuity. With them, we establish several common fixed point…

Functional Analysis · Mathematics 2011-05-24 Hakima Bouhadjera , Christiane Godet-Thobie

This paper proposes a modal typing system that enables us to handle self-referential formulae, including ones with negative self-references, which on one hand, would introduce a logical contradiction, namely Russell's paradox, in the…

Logic in Computer Science · Computer Science 2017-03-30 Hiroshi Nakano

I overview the work of the Tbilisi school on intuitionistic modal logics of well-founded/scattered structures and its connections with contemporary theoretical computer science. Fixed-point theorems and their consequences are of particular…

Logic in Computer Science · Computer Science 2017-08-21 Tadeusz Litak

We propose an interpretation of the first-order answer set programming (FOASP) in terms of intuitionistic proof theory. It is obtained by two polynomial translations between FOASP and the bounded-arity fragment of the Sigma_1 level of the…

Logic in Computer Science · Computer Science 2018-05-01 Aleksy Schubert , Paweł Urzyczyn

We revisit the issue of connections between two leading formalisms in nonmonotonic reasoning: autoepistemic logic and default logic. For each logic we develop a comprehensive semantic framework based on the notion of a belief pair. The set…

Artificial Intelligence · Computer Science 2007-05-23 Marc Denecker , Victor W. Marek , Miroslaw Truszczynski

In this paper, influenced by the ideas from A. Mihail, The canonical projection between the shift space of an IIFS and its attractor as a fixed point, Fixed Point Theory Appl., 2015, Paper No. 75, 15 p., we associate to every generalized…

Classical Analysis and ODEs · Mathematics 2018-03-20 Radu Miculescu , Silviu Urziceanu

An irreducible canonical approach to second-class constraints reducible of an arbitrary order is given. This method generalizes our previous results from [Europhys. Lett. 50 (2000) 169, J. Phys. A: Math. Theor. 40 (2007) 14537] for first-…

Mathematical Physics · Physics 2009-04-13 C. Bizdadea , E. M. Cioroianu , I. Negru , S. O. Saliu , S. C. Sararu , O. Balus

In this paper, we develop an Isabelle/HOL library of order-theoretic fixed-point theorems. We keep our formalization as general as possible: we reprove several well-known results about complete orders, often with only antisymmetry or…

Logic in Computer Science · Computer Science 2023-06-22 Jérémy Dubut , Akihisa Yamada

A fixed point theorem is proved for inverse transducers, leading to an automata-theoretic proof of the fixed point subgroup of an endomorphism of a finitely generated virtually free group being finitely generated. If the endomorphism is…

Group Theory · Mathematics 2012-03-13 Pedro V. Silva

Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…

Discrete Mathematics · Computer Science 2015-12-02 Arnaud Carayol , Zoltan Esik

Heyting-Lewis Logic is the extension of intuitionistic propositional logic with a strict implication connective that satisfies the constructive counterparts of axioms for strict implication provable in classical modal logics. Variants of…

Logic · Mathematics 2026-03-02 Jim de Groot , Tadeusz Litak , Dirk Pattinson

We introduce a new class of abstract structures, which we call generalized ultrametric semilattices, and in which the meet operation of the semilattice coexists with a generalized distance function in a tightly coordinated way. We prove a…

Logic in Computer Science · Computer Science 2013-09-05 Eleftherios Matsikoudis , Edward A. Lee

For every univariate formula $\chi$ we introduce a lattices of intermediate theories: the lattice of $\chi$-logics. The key idea to define chi-logics is to interpret atomic propositions as fixpoints of the formula $\chi^2$, which can be…

Logic · Mathematics 2023-03-21 Gianluca Grilletti , Davide Emilio Quadrellaro

We define a novel, extensional, three-valued semantics for higher-order logic programs with negation. The new semantics is based on interpreting the types of the source language as three-valued Fitting-monotonic functions at all levels of…

Programming Languages · Computer Science 2019-07-25 Angelos Charalambidis , Panos Rondogiannis , Ioanna Symeonidou

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…

Logic in Computer Science · Computer Science 2013-09-05 José Espírito Santo , Ralph Matthes , Luís Pinto

We obtain an equivariant index theorem, or Lefschetz fixed-point formula, for isometries from complete Riemannian manifolds to themselves. The fixed-point set of such an isometry may be noncompact. We build on techniques developed by Roe.…

Differential Geometry · Mathematics 2024-01-10 Peter Hochs

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

Logic in Computer Science · Computer Science 2012-10-10 Jakub Michaliszyn , Jan Otop , Piotr Witkowski