中文
相关论文

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

200 篇论文

This article is the first of an intended series of works on the model theory of Ultrafinitism. It is roughly divided into two parts. The first one addresses some of the issues related to ultrafinitistic programs, as well as some of the core…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Mirco A. Mannucci , Rose M. Cherubin

This paper introduces a formal notion of fixed point explanations, inspired by the "why regress" principle, to assess, through recursive applications, the stability of the interplay between a model and its explainer. Fixed point…

机器学习 · 计算机科学 2025-10-15 Emanuele La Malfa , Jon Vadillo , Marco Molinari , Michael Wooldridge

Following the definition of intuitionistic fuzzy n-norm [ 3 ], we have introduced the definition of intuitionistic fuzzy norm (in short IFN) over a linear space and there after a few results on intuitionistic fuzzy normed linear space and…

综合数学 · 数学 2015-03-13 T. K. Samanta , Iqbal H. Jebril

We study the S5-modal expansion of the logic based on the Lukasiewicz t-norm. We exhibit a finitary propositional calculus and show that it is finitely strongly complete with respect to this logic. This propositional calculus is then…

逻辑 · 数学 2024-08-12 Diego Castaño , José Patricio Díaz Varela , Gabriel Savoy

In aiming to apply to a broader class of examples the Avigad-Iovino "ultraproducts and metastability" approach to obtaining uniformity for convergence of sequences, we construct a framework using continuous logic that in particular is able…

逻辑 · 数学 2019-01-28 Simon Cho

Affine continuous logic is extended to affine integration logic. Affine compactness theorem is proved by both the ultramean construction and Henkin's method. Also, a proof system and a completeness theorem are given. An appropriate variant…

逻辑 · 数学 2026-02-24 Seyed-Mohammad Bagheri

In this paper, we present a proof of the consistency of the New Foundations set theory ($\mathit{NF}$). $\mathit{NF}$'s main idea is to permit very large sets (including the Universal Set) by restricting set formation to stratified…

逻辑 · 数学 2025-09-05 Nicolás Sevilla Simón

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

人工智能 · 计算机科学 2013-03-26 Jerome Lang , Didier Dubois , Henri Prade

In this paper, first we have established two sets of sufficient conditions for a mapping to have unique fixed point in a intuitionistic fuzzy metric space and then we have redefined the contraction mapping in a intuitionistic fuzzy metric…

综合数学 · 数学 2010-11-09 T. K. Samanta , Sumit Mohinta , Iqbal H. Jebril

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

计算机科学中的逻辑 · 计算机科学 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

Here I prove some extension theorem for multifunctions in a space with an arbitrary uniform structure and orbital completeness. The motivation comes from a fixed point theorem due to Dhage which is proved as a special case of the theorem…

泛函分析 · 数学 2007-05-23 Pratip Chakraborty

Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete lattices and used to give semantics to logic programs with negation and boolean context-free grammars. We prove…

计算机科学中的逻辑 · 计算机科学 2015-12-11 Zoltan Esik

We define a stable model semantics for fuzzy propositional formulas, which generalizes both fuzzy propositional logic and the stable model semantics of classical propositional formulas. The syntax of the language is the same as the syntax…

人工智能 · 计算机科学 2025-06-17 Joohyung Lee , Yi Wang

We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Michael Benedikt , Pierre Bourhis , Michael Vanden Boom

We investigate the properties of Inclusion Logic, that is, First Order Logic with Team Semantics extended with inclusion dependencies. We prove that Inclusion Logic is equivalent to Greatest Fixed Point Logic, and we prove that all…

计算机科学中的逻辑 · 计算机科学 2013-05-01 Pietro Galliani , Lauri Hella

From last decade, when Molodtsov introduced the theory of soft set as a new approach to deal with uncertainties, until now this theory was considered sharply by a fair number of researchers. Combination of fuzzy set theory and soft set…

泛函分析 · 数学 2013-09-20 Azadeh Zahedi Khameneh , Adem Kilicman , Abdul Razak Salleh

We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

泛函分析 · 数学 2014-01-03 M. El Azhari

Ultrafinitism postulates that we can only compute on relatively short objects, and numbers beyond certain value are not available. This approach would also forbid many forms of infinitary reasoning and allow to remove certain paradoxes…

编程语言 · 计算机科学 2024-08-22 Michał J. Gajda

Classical logic has a serious limitation in that it cannot cope with the issues of vagueness and uncertainty into which fall most modes of human reasoning. In order to provide a foundation for human knowledge representation and reasoning in…

人工智能 · 计算机科学 2016-08-30 Van Hung Le

Existential fixed point logic (EFPL) is a natural fit for some applications, and the purpose of this talk is to attract attention to EFPL. The logic is also interesting in its own right as it has attractive properties. One of those…

计算机科学中的逻辑 · 计算机科学 2008-11-07 Andreas Blass , Yuri Gurevich