Basic Predicate Logic, BQC, is a proper subsystem of Intuitionistic Predicate Logic, IQC. For every formula in the language {, , , , , , }, we associate two sequences of formulas 0,1,... and 0,1,... in the same language. We prove that for every sequent , there are natural numbers m, n, such that IQC , iff BQC n m. Some applications of this translation are mentioned.

This study described the relationships between academic class and student moral sensitivity and reasoning and between curriculum design components for ethics education and student moral sensitivity and reasoning. The data were collected from freshman (n = 506) and senior students (n = 440) in eight baccalaureate nursing programs in South Korea by survey; the survey consisted of the Korean Moral Sensitivity Questionnaire and the Korean Defining Issues Test. The results showed that moral sensitivity scores in patient-oriented care and conflict were (...) higher in senior students than in freshman students. Furthermore, more hours of ethics content were associated with higher principled thinking scores of senior students. Nursing education in South Korea may have an impact on developing student moral sensitivity. Planned ethics content in nursing curricula is necessary to improve moral sensitivity and moral reasoning of students. (shrink)

The connection between the infinite nature of Quantum Cosmology and the infinite nature of God is presented here. At the beginning of the creation process, there was a single God/Void that was divided into many Gods/Voids all filled with Dark Energy consisting of photons which were responsible for creating the Multiverses made of matter, antimatter, space, time, charge, and multiple dimensions of space. The one God initially had no material existence which along with the laws of science was a creation (...) of the powers of His infinite mind. Since the process of creation started with the Dark Energy of the Voids, the Conservation of Energy Principle applied to all of them. If the Dark Energy of each Void were to be finite, then its energy would begin to decrease as Multiverses were created, and the only solution for not violating the Conservation of Energy Principle was that the Dark Energy of each of the Voids must be infinite implying that the Voids themselves must be infinite, and with infinite amount of energy be able to create an infinite number of Multiverses. According to Mathematics, all infinite numbers are not equal, some infinities are greater than other infinities. Hence of the many infinite Voids that were initially created, some Voids were greater than others. Each Void has a Supreme Leader that we refer to as God, and therefore there exist many Gods, some Gods more powerful than other Gods. (shrink)

We prove that every infinite rooted narrow tree Kripke model of HA is locally PA.

In "Intuitionistic validity in -normal Kripke structures," Buss asked whether every intuitionistic theory is, for some classical theory , that of all -normal Kripke structures for which he gave an r.e. axiomatization. In the language of arithmetic and denote PA plus Open Induction or Open LNP, and are their intuitionistic deductive closures. We show is recursively axiomatizable and , while . If proves PEM but not totality of a classically provably total Diophantine function of , then and so . A (...) result due to Wehmeier then implies . We prove is not -conservative over . If , then is not closed under MR or Friedman's translation, so range (). Both and are closed under the negative translation. (shrink)

We present an axiomatization for Basic Propositional Calculus BPC and give a completeness theorem for the class of transitive Kripke structures. We present several refinements, including a completeness theorem for irreflexive trees. The class of intermediate logics includes two maximal nodes, one being Classical Propositional Calculus CPC, the other being E1, a theory axiomatized by T → ⊥. The intersection CPC ∩ E1 is axiomatizable by the Principle of the Excluded Middle A V ∨ ⌝A. If B is a formula (...) such that → B is not derivable, then the lattice of formulas built from one propositional variable p using only the binary connectives, is isomorphically preserved if B is substituted for p. A formula → B is derivable exactly when B is provably equivalent to a formula of the form → A) →. (shrink)

A latarre is a lattice with an arrow. Its axiomatization looks natural. Latarres have a nontrivial theory which permits many constructions of latarres. Latarres appear as an end result of a series of generalizations of better known structures. These include Boolean algebras and Heyting algebras. Latarres need not have a distributive lattice.

We prove that Basic Arithmetic, BA, has the de Jongh property, i.e., for any propositional formula A built up of atoms p1,..., pn, BPC⊢\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\vdash}$$\end{document}A if and only if for all arithmetical sentences B1,..., Bn, BA⊢\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\vdash}$$\end{document}A. The technique used in our proof can easily be applied to some known extensions of BA.

Let ℒ and ? be propositional languages over Basic Propositional Calculus, and ℳ = ℒ∩?. Weprove two different but interrelated interpolation theorems. First, suppose that Π is a sequent theory over ℒ, and Σ∪ {C⇒C′} is a set of sequents over ?, such that Π,Σ⊢C⇒C′. Then there is a sequent theory Φ over ℳ such that Π⊢Φ and Φ, Σ⊢C⇒C′. Second, let A be a formula over ℒ, and C 1, C 2 be formulas over ?, such that A∧C 1⊢C (...) 2. Then there exists a formula B over ℳ such that A⊢B and B∧C 1⊢C 2. (shrink)

A bounded monotone sequence of reals without a limit is called a Specker sequence. In Russian constructive analysis, Church's Thesis permits the existence of a Specker sequence. In intuitionistic mathematics, Brouwer's Continuity Principle implies it is false that every bounded monotone sequence of real numbers has a limit. We claim that the existence of Specker sequences crucially depends on the properties of intuitionistic decidable sets. We propose a schema about intuitionistic decidability that asserts “there exists an intuitionistic enumerable set that (...) is not intuitionistic decidable” and show that the existence of a Specker sequence is equivalent to ED. We show that ED is consistent with some certain well known axioms of intuitionistic analysis as Weak Continuity Principle, bar induction, and Kripke Schema. Thus, the assumption of the existence of a Specker sequence is conceivable in intuitionistic analysis. We will also introduce the notion of double Specker sequence and study the existence of them. (shrink)

In this paper we prove a bounded translation of intuitionistic propositional logic into basic propositional logic. Our new theorem, compared with the translation theorem in [1], has the advantage that it gives an effective bound on the translation, depending on the complexity of formulas.

We present axiom systems, and provide soundness and strong completeness theorems, for classes of Kripke models with restricted extension rules among the node structures of the model. As examples we present an axiom system for the class of cofinal extension Kripke models, and an axiom system for the class of end-extension Kripke models. We also show that Heyting arithmetic is strongly complete for its class of end-extension models. Cofinal extension models of HA are models of Peano arithmetic.

We represent the well-known surprise exam paradox in constructive and computable mathematics and offer solutions. One solution is based on Brouwer’s continuity principle in constructive mathematics, and the other involves type 2 Turing computability in classical mathematics. We also discuss the backward induction paradox for extensive form games in constructive logic.

Kolmogorov established the principle of the double negation translation by which to embed Classical Predicate Logic |${\operatorname {CQC}}$| into Intuitionistic Predicate Logic |${\operatorname {IQC}}$|⁠. We show that the obvious generalizations to the Basic Predicate Logic of [3] and to |${\operatorname {BQC}}$| of [12], a proper subsystem of |${\operatorname {IQC}}$|⁠, go through as well. The obvious generalizations of Kuroda’s embedding are shown to be equivalent to the Kolmogorov variant. In our proofs novel nontrivial techniques are needed to overcome the absence of (...) full modus ponens in Basic Predicate Logic. In [3] we argued that |${\operatorname {IQC}}$| is not the logic of constructive mathematics. Our doubts were far from new. New was that we put forward an alternative, |${\operatorname {BQC}}$|⁠. One concern is that |${\operatorname {BQC}}$| is too weak for serious mathematics, or even trivial. This paper is one step to alleviate such concerns. (shrink)

In the context of intuitionistic analysis, we consider the set consisting of all continuous functions from [0,1] to such that =0 and =1, and the set consisting of ’s in where there exists x[0,1] such that . It is well-known that there are weak counterexamples to the intermediate value theorem, and with Brouwer’s continuity principle we have . However, there exists no satisfying answer to . We try to answer to this question by reducing it to a schema about intuitionistic (...) decidability that asserts “there exists an intuitionistically enumerable set that is not intuitionistically decidable”. We also introduce the notion of strong Specker double sequence, and prove that the existence of such a double sequence is equivalent to the existence of a function where. (shrink)

For the Heyting Arithmetic HA, $HA^{\text{*}} $ is defined [14, 15] as the theory $\left\{ {A|HA \vdash A^\square } \right\}$, where $A^\square $ is called the box translation of A. We characterize the ${\text{\Sigma }}_1 $-provability logic of $HA^{\text{*}} $ as a modal theory $iH_\sigma ^{\text{*}} $.

We give a counterexample to the claim that every provably total function of Basic Arithmetic is a polynomially bounded primitive recursive function.

Let denote a first‐order logic in a language that contains infinitely many constant symbols and also containing intuitionistic logic. By, we mean the associated logic axiomatized by the double negation of the universal closure of the axioms of plus. We shall show that if is strongly complete for a class of Kripke models, then is strongly complete for the class of Kripke models that are ultimately in.

Let A be a subset of the constructive real line. What are the necessary and sufficient conditions for the set A such that A is continuously separated from other reals, i.e., there exists a continuous function f with f−1(0) = A? In this paper, we study the notions of closed sets and closure maps in constructive reverse mathematics.

Avicenna introduces the primary propositions as the most fundamental principles of knowledge. However, as far as we are aware, Avicenna’s primaries have not yet been independently studied. Nor do Avicenna scholars agree on how to characterize them in the language of contemporary philosophy. It is well-known that the primaries are indemonstrable; nonetheless, it is not clear what the genealogy of the primaries is, how, epistemologically speaking, they can be distinguished from other principles, what their phenomenology is, what the cause of (...) the assent to them is, how to explain the relationship between the ‘innate [nature] of the intellect’ and the primaries and, finally, back to their indemonstrability, in what sense they are ‘indemonstrable’. We will try to fill this gap. As a corollary, we will explain why Gutas’s view [Gutas, Dimitri.... (shrink)

Ibn al-ʻArabī, 1165-1240; views on freedom; Sufism; Islamic philosophy.

Text-generative AI-systems have become important semantic agents with ChatGPT. We conducted a series of experiments to learn what teachers’ conceptions of text-generative AI are in relation to philosophical texts. In our main experiment, using mixed methods, we had twenty-four high school students write philosophical essays, which we then randomized to essays with the same command from ChatGPT. We had ten prospective teachers assess these essays. They were able to tell whether it was an AI or student essay with 78.7 percent (...) accuracy, which is better than the Open AI Classifier. Interestingly, however, they used criteria like argumentative and logical flawlessness and neutrality. We concluded from this that they are using an inverted Turing test and are no longer looking for rationality in machines but for irrationality in humans. (shrink)

Contrary to Vaesen's argument that humans are unique with respect to nine cognitive capacities essential for tool use, we suggest that although such cognitive processes contribute to variation in tool use, it does not follow that these capacities arenecessaryfor tool use, nor that tool use shaped cognition per se, given the available data in cognitive neuroscience and behavioral biology.

We generalize the double negation construction of Boolean algebras in Heyting algebras to a double negation construction of the same in Visser algebras. This result allows us to generalize Glivenko’s theorem from intuitionistic propositional logic and Heyting algebras to Visser’s basic propositional logic and Visser algebras.

We introduce two Gentzen-style sequent calculus axiomatizations for conservative extensions of basic propositional logic. Our first axiomatization is an ipmrovement of, in the sense that it has a kind of the subformula property and is a slight modification of. In this system the cut rule is eliminated. The second axiomatization is a classical conservative extension of basic propositional logic. Using these axiomatizations, we prove interpolation theorems for basic propositional logic.

We study the linear Lindenbaum algebra of Basic Propositional Calculus, called linear basic algebra.

We study the variety of Löb algebras , the algebraic structures associated with formal propositional calculus. Among other things, we prove a completeness theorem for formal propositional logic with respect to the variety of Löb algebras. We show that the variety of Löb algebras has the weak amalgamation property. Some interesting subclasses of the variety of Löb algebras, e.g. linear, faithful and strongly linear Löb algebras are introduced.

In recent literature, panpsychism has been defended by appeal to two main arguments: first, an argument from philosophy of mind, according to which panpsychism is the only view which successfully integrates consciousness into the physical world (Strawson 2006; Chalmers 2013); second, an argument from categorical properties, according to which panpsychism offers the only positive account of the categorical or intrinsic nature of physical reality (Seager 2006; Adams 2007; Alter and Nagasawa 2012). Historically, however, panpsychism has also been defended by appeal (...) to a third argument based on considerations about the nature and observability of causation. This argument has not been much discussed in recent times. Here is a concise version from William James: "… the concrete perceptual flux, taken just as it comes, offers in our own activity-situations perfectly comprehensible instances of causal agency … If we took these experiences as the type of what actual causation is, we should have to ascribe to cases of causation outside of our life, to physical cases also, an inwardly experiential nature. In other words, we should have to espouse a so-called “pan-psychic” philosophy" (James 1911: 218). James here suggests that we have direct experience of causation in our own agency. He thereby directly contradicts David Hume, who famously denied that we have any experience of causation. James goes on to claim that if this experience is representative of causation in general, it follows that all causation is mental, and that panpsychism is true. This kind of argument for panpsychism can be called the argument from (experience of) causation. This chapter offers, first, a history of this argument and arguments closely related to it, and second, an analysis of the argument – is it valid, are its premises in any way defensible, and how does it relate to the other, more popular arguments for panpsychism from philosophy of mind and categorical properties? (shrink)

This paper is devoted to the study of some subvarieties of the variety Qof Q-Heyting algebras, that is, Heyting algebras with a quantifier. In particular, a deeper investigation is carried out in the variety Q 3 of three-valued Q-Heyting algebras to show that the structure of the lattice of subvarieties of Qis far more complicated that the lattice of subvarieties of Heyting algebras. We determine the simple and subdirectly irreducible algebras in Q 3 and we construct the lattice of subvarieties (...) (Q 3 ) of the variety Q 3. (shrink)

Traditional Chinese commentators rightly see that understanding Zhuangzi's way with words is the presupposition for understanding Zhuangzi at all. They are not sure, however, if Zhuangzi's words are super-effective or pure nonsense. I consider Zhuangzi's experience with language, and then turn to Heidegger's word of being to see if it may throw light on Zhuangzi's way of saying. I argue that a conversation between Heidegger and Zhuangzi on language is possible, but only by expanding Heidegger's notion of Gestell and through (...) a destruction of the dominant Confucian discourse that obscures Zhuangzi's way of saying. (shrink)

Several variants of Lewis's Best System Account of Lawhood have been proposed that avoid its commitment to perfectly natural properties. There has been little discussion of the relative merits of these proposals, and little discussion of how one might extend this strategy to provide natural property-free variants of Lewis's other accounts, such as his accounts of duplication, intrinsicality, causation, counterfactuals, and reference. We undertake these projects in this paper. We begin by providing a framework for classifying and assessing the variants (...) of the Best System Account. We then evaluate these proposals, and identify the most promising candidates. We go on to develop a proposal for systematically modifying Lewis's other accounts so that they, too, avoid commitment to perfectly natural properties. We conclude by briefly considering a different route one might take to developing natural property-free versions of Lewis's other accounts, drawing on recent work by Williams. (shrink)

We introduce a Gentzen-style sequent calculus axiomatization for Basic Predicate Calculus. Our new axiomatization is an improvement of the previous axiomatizations, in the sense that it has the subformula property. In this system the cut rule is eliminated.

We study Basic algebra, the algebraic structure associated with basic propositional calculus, and some of its natural extensions. Among other things, we prove the amalgamation property for the class of Basic algebras, faithful Basic algebras and linear faithful Basic algebras. We also show that a faithful theory has the interpolation property if and only if its correspondence class of algebras has the amalgamation property.