Javascript must be enabled to continue!
Access-based intuitionistic knowledge
View through CrossRef
Abstract
We introduce the concept of $\textit{access-based}$ intuitionistic knowledge which relies on the intuition that agent $i$ knows $\varphi$ if $i$ has found $\textit{access to a proof}$ of $\varphi$. Basic principles are distribution and factivity of knowledge as well as $\square\varphi\rightarrow K_i\varphi$ and $K_i(\varphi\vee\psi) \rightarrow (K_i\varphi\vee K_i\psi)$, where $\square\varphi$ reads $`\varphi$ is proved'. The formalization extends a family of classical modal logics (Lewitzka, 2017, Journal of Logic and Computation, 27, 201--212) designed as combinations of $\mathit{IPC}$ and $\mathit{CPC}$ and as systems for the reasoning about proof, i.e. intuitionistic truth. We adopt a formalization of common knowledge from (Lewitzka, 2011, Studia Logica, 97, 233--264) and interpret it here as access-based common knowledge. We compare our proposal with recent approaches to intuitionistic knowledge (Artemov and Protopopescu, 2016, The Review of Symbolic Logic, 9, 266--298; Lewitzka, 2019, Annals of Pure and Applied Logic, 170, 218--250) and bring together these different concepts in a unifying semantic framework based on Heyting algebra expansions.
Title: Access-based intuitionistic knowledge
Description:
Abstract
We introduce the concept of $\textit{access-based}$ intuitionistic knowledge which relies on the intuition that agent $i$ knows $\varphi$ if $i$ has found $\textit{access to a proof}$ of $\varphi$.
Basic principles are distribution and factivity of knowledge as well as $\square\varphi\rightarrow K_i\varphi$ and $K_i(\varphi\vee\psi) \rightarrow (K_i\varphi\vee K_i\psi)$, where $\square\varphi$ reads $`\varphi$ is proved'.
The formalization extends a family of classical modal logics (Lewitzka, 2017, Journal of Logic and Computation, 27, 201--212) designed as combinations of $\mathit{IPC}$ and $\mathit{CPC}$ and as systems for the reasoning about proof, i.
e.
intuitionistic truth.
We adopt a formalization of common knowledge from (Lewitzka, 2011, Studia Logica, 97, 233--264) and interpret it here as access-based common knowledge.
We compare our proposal with recent approaches to intuitionistic knowledge (Artemov and Protopopescu, 2016, The Review of Symbolic Logic, 9, 266--298; Lewitzka, 2019, Annals of Pure and Applied Logic, 170, 218--250) and bring together these different concepts in a unifying semantic framework based on Heyting algebra expansions.
Related Results
Intuitionistic Fuzzy Soft Hyper BCK Algebras
Intuitionistic Fuzzy Soft Hyper BCK Algebras
Maji et al. introduced the concept of fuzzy soft sets as a generalization of the standard soft sets, and presented an application of fuzzy soft sets in a decision-making problem. M...
Intuitionistic Fuzzy Rough TOPSIS Method for Robot Selection using Einstein operators
Intuitionistic Fuzzy Rough TOPSIS Method for Robot Selection using Einstein operators
Abstract
Rough set and intuitionistic fuzzy set are very vital role in the decision making method for handling the uncertain and imprecise data of decision makers. The tech...
Two Approaches to the Traffic Quality Intuitionistic Fuzzy Estimation of Service Compositions
Two Approaches to the Traffic Quality Intuitionistic Fuzzy Estimation of Service Compositions
Recently, intuitionistic fuzzy pairs have been used as uncertainty estimations of the request services in service systems. In the present paper, three intuitionistic fuzzy characte...
Comparison of single server queuing performance measures using fuzzy queuing models and intuitionistic fuzzy queuing models with infinite capacity
Comparison of single server queuing performance measures using fuzzy queuing models and intuitionistic fuzzy queuing models with infinite capacity
This paper presents boundless capacity, one server’s fuzzy and intuitionistic fuzzy queuing models. This study’s primary objective is to demonstrate and compare the performance of ...
Some Connectivity Parameters of Interval-Valued Intuitionistic Fuzzy Graphs with Applications
Some Connectivity Parameters of Interval-Valued Intuitionistic Fuzzy Graphs with Applications
Connectivity in graphs is useful in describing different types of communication systems like neural networks, computer networks, etc. In the design of any network, it is essential ...
Potable Water Sources, Household Hygiene, and Sanitation Practices in Ikpoba Okha LGA, Edo State: Implications for Public Health and Sustainable Water Management
Omoregie, Andrew Edosa.1 Omoregie Abieyuwa Peace2 Okoro, Enyinnaya Okoro.3
1 College of Medi
Potable Water Sources, Household Hygiene, and Sanitation Practices in Ikpoba Okha LGA, Edo State: Implications for Public Health and Sustainable Water Management
Omoregie, Andrew Edosa.1 Omoregie Abieyuwa Peace2 Okoro, Enyinnaya Okoro.3
1 College of Medi
BACKGROUND
Access to potable drinking water and sufficient sanitation continues to be an urgent global concern, particularly in developing regions where con...
Intuitionistic fine space
Intuitionistic fine space
In the exploration of intuitionistic fine spaces, this article introduces a novel concept known as intuitionistic fine open sets (IfOS). Delving into the properties of these sets, ...
Crossing Intuitionistic KUS-Ideals on KUS-Algebras as an Extension of Bipolar Fuzzy Sets
Crossing Intuitionistic KUS-Ideals on KUS-Algebras as an Extension of Bipolar Fuzzy Sets
The concept crossing intuitionistic structures set is combination of intuitionistic fuzzy set and ℵfunction.In this paper,the concept crossing intuitionistic ideals are introduc...

