English
Related papers

Related papers: Effectively constructible fixed points in Sacchett…

200 papers

We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…

Logic in Computer Science · Computer Science 2021-08-24 Johannes Marti

Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions…

Logic in Computer Science · Computer Science 2020-02-19 Amelia Harrison , Vladimir Lifschitz , Miroslaw Truszczynski

We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on…

Logic in Computer Science · Computer Science 2026-03-25 Valérie Berthé , Toghrul Karimov , Joris Nieuwveld , Joël Ouaknine , Mihir Vahanwala , James Worrell

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

By using some elementary techniques from operator theory, we prove constructively prove the existence of solutions to Dirichl\'et problems for planar Jordan domains with at least two boundary curves. An iterative method is thus obtained,…

Complex Variables · Mathematics 2013-07-25 Timothy H. McNicholl

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…

Logic in Computer Science · Computer Science 2015-05-22 Andreas Teucke , Christoph Weidenbach

In this present article, we etablish some existence results of $\varphi-$fixed point of a mapping in a $C^{\ast}$-algebra valued metric spaces and we deduce some fixed point theorems in $C^{\ast}$-algebra valued partial metric spaces.…

Operator Algebras · Mathematics 2022-04-20 Hafida Massit , Mohamed Rossafi

In this paper we consider the problem of certified static checking of module-like constructs of programming languages. We argue that there are algorithms and properties related to modules that can be defined and proven in an abstract way.…

Programming Languages · Computer Science 2017-06-20 Julia Belyakova

In the renormalisation analysis of critical phenomena in quasi-periodic systems, a fundamental role is often played by fixed points of functional recurrences of the form \begin{equation*} f_{n}(x) = \sum_{i=1}^\ell a_i(x) f_{n_i}…

Dynamical Systems · Mathematics 2013-11-12 Paul Verschueren , Ben D. Mestel

We give a constructive proof of the classical Cauchy-Kovalevskaya theorem in the ODE setting which provides a sufficient condition for an initial value problem to have a unique analytic solution. Our proof is inspired by a modern functional…

Classical Analysis and ODEs · Mathematics 2020-12-16 Shane Kepley , Tianhao Zhang

We consider bounded 2-metric spaces satisfying an additional axiom, and show that a contractive mapping has either a fixed point or a fixed line.

Metric Geometry · Mathematics 2011-04-08 Abdelkrim Aliouche , Carlos T. Simpson

In this follow-up paper, we again inspect a surprising connection between the set of fixed points of a polynomial map $\varphi_{d,c}$ defined by $\varphi_{d,c}(z) = z^d + c$ for all $c, z \in \mathcal{O}_{K}$ and the coefficient $c$, where…

Number Theory · Mathematics 2026-01-16 Brian Kintu

We consider propositional modal logic with two modal operators $\Box$ and $\D$. In topological semantics $\Box$ is interpreted as an interior operator and $\D$ as difference. We show that some important topological properties are…

Logic · Mathematics 2010-11-29 Kudinov Andrey

A $K$-Fibonacci sequence is a binary recurrence sequence where $F_0=0$, $F_1=1$, and $F_n=K\cdot F_{n-1}+F_{n-2}$. These sequences are known to be periodic modulo every positive integer greater than $1$. If the length of one shortest period…

Number Theory · Mathematics 2024-07-30 Brennan Benfield , Oliver Lippard

We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that,…

Logic · Mathematics 2019-05-07 Juan P. Aguilera

We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…

Logic · Mathematics 2014-02-26 G. O. Jones , A. J. Wilkie

We define the modulo-$m$ Toeplitz fixed point generated by Toeplitz substitution and study the lattice subsequence of such fixed point. Moreover, we provide a method to check whether one modulo-$m$ Toeplitz fixed point is a lattice…

Combinatorics · Mathematics 2024-07-29 Shishuang Liu , Hui Rao

For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…

Logic · Mathematics 2023-11-08 Robert Goldblatt

We establish some common fixed point results for four transformations in vector S-metric spaces by using the notion of weakly compatibility (WC) and occasionally weakly compatibility (OWC). The first theorem is proved by using the concept…

General Mathematics · Mathematics 2022-08-29 Pooja Yadav , Mamta Kamra

We present a modification of the superposition calculus that is meant to generate explanations why a set of clauses is satisfiable. This process is related to abductive reasoning, and the explanations generated are clauses constructed over…

Logic in Computer Science · Computer Science 2015-03-20 Mnacho Echenim , Nicolas Peltier
‹ Prev 1 8 9 10 Next ›