Related papers: Tarski's least fixed point theorem: A predicative …

Let T be a countable, small simple theory. In this paper, we prove for such T, the notion of Lascar Strong type coincides with the notion of a strong type,over an arbitrary set.

Many formal languages of contemporary mathematical music theory -- particularly those employing category theory -- are powerful but cumbersome: ideas that are conceptually simple frequently require expression through elaborate categorical…

In this article, we prove some fixed point theorems in metric type spaces. This article is just a generalization some results previously proved in \cite{niyi-gaba}. In particular, we give some coupled common fixed points theorems under weak…

We construct a realizability model of linear dependent type theory from a linear combinatory algebra. Our model motivates a number of additions to the type theory. In particular, we add a universe with two decoding operations: one takes…

In 1980's, Thurston established a combinatorial characterization for post-critically finite rational maps. This criterion was then extended by Cui, Jiang, and Sullivan to sub-hyperbolic rational maps. The goal of this paper is to present a…

We verify the inductive McKay condition for simple groups of Lie type C, namely finite projective symplectic groups. This contributes to the program of a complete proof of the McKay conjecture for all finite groups via the reduction theorem…

We investigate predicative aspects of constructive univalent foundations. By predicative and constructive, we respectively mean that we do not assume Voevodsky's propositional resizing axioms or excluded middle. Our work complements…

This paper examines the application of Tarski's Undefinability Theorem to first-order arithmetic. The generally accepted view is that for this case the Theorem establishes that arithmetic truth is not arithmetic. A careful examination of…

We introduce several classes of set-valued maps with generalized convexity. We obtain minimax theorems for set-valued maps which satisfy the introduced properties and are not continuous, by using a fixed point theorem for weakly naturally…

The concept of fixed point plays a crucial role in various fields of applied mathematics. The aim of this paper is to establish the existence of a unique fixed point of some type of functions which satisfy a new contraction principle,…

In this paper, we present an integral Suzuki-type fixed point theorem for multivalued mappings defined on a complete metric space in terms of the \'{C}iri\'{c} integral contractions. As an application, we will prove an existence and…

We introduce a new type of mappings in metric space which are three-point analogue of the well-known Chatterjea type mappings, and call them generalized Chatterjea type mappings. It is shown that such mappings can be discontinuous as is the…

Within dependent type theory, we provide a topological counterpart of well-founded trees (for short, W-types) by using a proof-relevant version of the notion of inductively generated suplattices introduced in the context of formal topology…

In this paper, we present some fixed point theorems for operator systems in the line of Krasnosel'skii's theorem in cones. The cone-compression and cone-expansion type conditions are imposed in a component-wise manner. Unlike related…

The main purpose of this work is to extend the properties of multivalued transformations to the integral type transformations and to obtain the existence of fixed points under F-contraction. In addition, the results of this study were…

In this paper, we introduce a new type of coupled fixed point theorem in partially ordered complete metric space. We give an example to support of our result.

We establish a coupled fixed points theorem for a meaningful class of mixed monotone multivalued operators and then we use it to derive some results on existence of quasisolutions and solutions to first--order functional differential…

Possibility theory offers either a qualitive, or a numerical framework for representing uncertainty, in terms of dual measures of possibility and necessity. This leads to the existence of two kinds of possibilistic causal graphs where the…

Typed feature structures are used extensively for the specification of linguistic information in many formalisms. The subsumption relation orders TFSs by their information content. We prove that subsumption of acyclic TFSs is well-founded,…

We present a domain-specific type theory for constructions and proofs in category theory. The type theory axiomatizes notions of category, functor, profunctor and a generalized form of natural transformations. The type theory imposes an…