Results 51 to 60 of about 5,025 (226)
Independence and conservativity results for intuitionistic set theory [PDF]
There are two main parts to this thesis. The first part will deal with some independence results. In 1979, Lifschitz in [13] introduced a realizability interpretation for Heyting's arithmetic, HA, that could differentiate between Church's thesis with ...
Chen, Ray-Ming
core
On Combining Intuitionistic and S4 Modal Logic
We address the problem of combining intuitionistic and S4 modal logic in a non-collapsing way inspired by the recent works in combining intuitionistic and classical logic.
João Rasga, Cristina Sernadas
doaj +1 more source
Kripke's Reduction of Löb's Theorem to the Second Incompleteness Theorem
ABSTRACT In this paper, we discuss Kripke's reduction of Löb's Principle to the Second Incompleteness Theorem. We have a closer look at the non‐constructive character of the reduction. We reflect on what the argument has to tell us. In the Appendix, We give a strengthening of Löb's Principle suggested by Kripke's reduction.
Albert Visser
wiley +1 more source
The Friedman-Sheard programme in intuitionistic logic [PDF]
This paper compares the roles classical and intuitionistic logic play in restricting the free use of truth principles in arithmetic. We consider fifteen of the most commonly used axiomatic principles of truth and classify every subset of them as either ...
Rathjen, M +4 more
core +1 more source
Designing and developing Intuitionistic Fuzzy Logic Toolbox in MATLAB: Membership and non-membership functions gallery [PDF]
The authors have designed and developed algorithms for pattern recognition and clustering techniques using intuitionistic fuzzy (IF) sets, IF operators, IF logic (IFL) – shortest path in networks using IF graphs and IF hypergraphs – video processing ...
Kaviranjanii G., Parvathi Rangasamy
doaj +1 more source
Kripke on Gödel Incompleteness
ABSTRACT This paper surveys six of Saul Kripke's highly creative ideas and results on Gödel incompleteness, from when he was an undergraduate to last publications. These include his extension of incompleteness from sentences to predicates, his model‐theoretic proof of incompleteness of arithmetic, his compelling analysis of incompleteness in terms of ...
Daniel Isaacson
wiley +1 more source
Intuitionistic computability logic
Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and "truth" is understood as algorithmic solvability, CL ...
openaire +3 more sources
Geometrisation of first-order logic
That every first-order theory has a coherent conservative extension is regarded by some as obvious, even trivial, and by others as not at all obvious, but instead remarkable and valuable; the result is in any case neither sufficiently well-known nor ...
Dyckhoff R. +3 more
core +1 more source
Hennessy-Milner Properties for (Modal) Bi-intuitionistic Logic
Bi-intuitionistic logic is an extension of intuitionistic propositional logic with a binary operator that is residuated with respect to disjunction.
Pattinson, Dirk, de Groot, Jim
core +1 more source
A New Perspective on Intuitionistic Fuzzy Structures in Sheffer Stroke BCK-Algebras
This study introduces the concept of an intuitionistic fuzzy SBCK-subalgebra (SBCK-ideal) and explores the level set of an intuitionistic fuzzy set within the context of Sheffer stroke BCK-algebras.
Ravi Kumar Bandaru +3 more
doaj +1 more source

