相关论文: Involutive uninorm logic with fixed point enjoys f…

In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a…

We present a unified categorical treatment of completeness theorems for several classical and intuitionistic infinitary logics with a proposed axiomatization. This provides new completeness theorems and subsumes previous ones by G\"odel,…

In the present article, we introduce a unified notion of multi-tupled fixed points and utilize the same to prove some existence and uniqueness unified multi-tupled fixed point theorems for Boyd-Wong type nonlinear contractions satisfying…

Fuzzy logic programming is an established approach for reasoning under uncertainty. Several semantics from classical, two-valued logic programming have been generalized to the case of fuzzy logic programs. In this paper, we show that two of…

Soft set theory, introduced by Molodtsov [Molodtsov, D. (1999). Soft set theory-first results. Comput. Math. Appl., 37(4-5), 19-31], provides a flexible framework for managing uncertainty and vagueness, addressing limitations in traditional…

In this work, we prove the existence of solutions for a tripled system of integral equations using some new results of fixed point theory associated with measure of noncompactness. These results extend some previous works in the literature,…

We study the fixed point problem for a system of multivariate operators that are coordinate-wise monotone (i.e., nondecreasing or nonincreasing in each of the variables, independently), in the setting of quasi-ordered sets. We show that…

Possibilistic logic is a well-known graded logic of uncertainty suitable to reason under incomplete information and partially inconsistent knowledge, which is built upon classical first order logic. There exists for Possibilistic logic a…

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…

The purpose of this paper is to present some multidimensional fixed-point theorems and their applications. For this, we provide a multidimensional fixed point theorem and then using this theorem we prove the existence and uniqueness of a…

We present a logic for reasoning with if-then formulas which involve constants for rational truth degrees from the unit interval. We introduce graded semantic and syntactic entailment of formulas. We prove the logic is complete in Pavelka…

We present a completeness result for the implicit fragment of justification stit logic. Although this fragment allows for no strongly complete axiomatization, we show that a restricted form of strong completeness (subsuming weak…

Fixed points for scalar theories in $4-\varepsilon$, $6-\varepsilon$ and $3-\varepsilon$ dimensions are discussed. It is shown how a large range of known fixed points for the four dimensional case can be obtained by using a general…

A logic has uniform interpolation if its formulas can be projected down to given subsignatures, preserving all logical consequences that do not mention the removed symbols; the weaker property of (Craig) interpolation allows the projected…

We propose some variants of Lefschetz fixed point theorem for Fourier-Mukai functors on a smooth projective algebraic variety. Independently we also suggest a similar theorem for endo-functors on the category of perfect modules over a…

Different notions of the consistency of obligations collapse in standard deontic logic. In justification logics, which feature explicit reasons for obligations, the situation is different. Their strength depends on a constant specification…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

We prove a fixed point theorem for closed-graphed, decomposable-valued correspondences whose domain and range is a decomposable set of functions from an atomless measure space to a topological space. One consequence is an improvement of the…

A Legendre transform of the recently discovered conformal fixed-point equation is constructed, providing an unintegrated equation encoding full conformal invariance within the framework of the effective average action.

We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that…