Related papers: On Tarski's fixed point theorem
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of…
A $G$-invariant version of definable Tietze extension theorem for definably complete structures is proved when a definably compact definable topological group $G$ acts definably and continuously on the definable set.
In this note, we discuss some fixed point theorems for contractive self mappings defined on a $G$-metric spaces. More precisely, we give fised point theorems for mappings with a contractive iterate at a point.
This paper presents a generalized version of a theorem of Grzegorek and Labuda in category bases and also endeavours to establish a variant formulation of the same in Marczewski structures.
We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or…
A simple convex lattice polytope $\Box$ defines a torus-equivariant line bundle $\LB$ over a toric variety $\XB.$ Atiyah and Bott's Lefschetz fixed-point theorem is applied to the torus action on the $d''$-complex of $\LB$ and information…
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
In this short note we present several infinite dimensional theorems which generalize corresponding facts from the finite dimensional differential inclusions theory.
We obtain an orthogonality space by endowing an implicative-ortholattice with a suitable orthogonality relation; for such spaces, we also investigate the particular case of implicative-orthomodular lattices. Moreover, we define the…
We introduce a new fixed point theorem of Krasnoselskii type for discontinuous operators. As an application we use it to study the existence of positive solutions of a second-order differential problem with separated boundary conditions and…
Fixed points represent equilibrium states, stability, and solutions to a range of problems. It has been an active field of research. In this paper, we provide an overview of the main branches of fixed point theory. We discuss the key…
In our previous papers, together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that - similar to relatively pseudocomplemented…
We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes…
In this paper we discuss the notion of completeness of topologized posets and survey some recent results on closedness properties of complete topologized semilattices.
We established a fixed-point theorem for mapping satisfying a general contractive inequality of integral type depended an another function. This theorem substantially extend the theorem due to Branciari (2003) and Rhoades (2003)
We review a few results concerning interpolation of monotone functions on infinite lattices, emphasizing the role of set-theoretic considerations. We also discuss a few open problems.
We present some results and conjectures on a generalization to the noncommutative setup of the Brouwer fixed-point theorem from the Borsuk-Ulam theorem perspective.
We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which…
We describe a new approach to the problem of putting supersymmetric theories on the lattice. The basic idea is to discretize a {\it twisted} formulation of the supersymmetric theory. For certain theories with extended supersymmetry these…