It is common for philosophers to claim that doxastic voluntarism, the view that an agent can form beliefs voluntarily, is false, and therefore that agents do not have the kind of control over their beliefs required for a straightforward application of deontological concepts such as obligation or duty in the domain of epistemology. The role that the denial of doxastic voluntarism plays in an argument to the effect that agents do not have obligations with respect to belief is simply this.

Two prejudices have hampered our understanding of John Stuart Mill’s central argument for free speech. One prejudice is that arguments for free speech can only be made in terms of values or rights. This prejudice causes us to miss the depth of Mill’s argument. He does not argue that silencing speech is harmful or violates rights, but instead that silencing speech is a uniquely self-undermining act; it undermines the ground upon which it is based. But even if we overcome this (...) prejudice and appreciate the self-undermining character of Mill’s argument, the prejudice that epistemic justification is a completable task blinds us to the role of open-mindedness in his argument; and failing to see this leads us to wrongly conclude that his argument is invalid. It is only once we have overcome both prejudices that we can appreciate the depth and power of Mill’s argument for free speech. (shrink)

Why can't deliberation conclude in an intention except by considering whether to perform the intended action? I argue that the answer to this question entails that reasons for intention are determined by reasons for action. Understanding this feature of practical deliberation thus allows us to solve the toxin puzzle.

Believing that p, assuming that p, and imagining that p involve regarding p as true—or, as we shall call it, accepting p. What distinguishes belief from the other modes of acceptance? We claim that conceiving of an attitude as a belief, rather than an assumption or an instance of imagining, entails conceiving of it as an acceptance that is regulated for truth, while also applying to it the standard of being correct if and only if it is true. We argue (...) that the second half of this claim, according to which the concept of belief includes a standard of correctness, is required to explain the fact that the deliberative question whether to believe that p is transparent to the question whether p. This argument raises various questions. Is there such a thing as deliberating whether to believe? Is the transparency of the deliberative question whether to believe that p the same as the transparency of the factual question whether I do believe that p? We will begin by answering these questions and then turn to a series of possible objections to our argument. (shrink)

We provide a fine‐grained analysis on the relation between König's lemma, weak König's lemma, and the decidable fan theorem in the context of constructive reverse mathematics. In particular, we show that double negated variants of König's lemma and weak König's lemma are equivalent to double negated variants of the general decidable fan theorem and the binary decidable fan theorem, respectively, over a nearly intuitionistic system containing a weak countable choice only. This implies that the general decidable fan theorem is not (...) equivalent to the binary decidable fan theorem in the absence of a strong countable choice. In addition, we introduce a principle which fills the gap between König's lemma and weak König's lemma, and show that König's lemma is equivalent to weak König's lemma plus this principle. We also solve several problems arising from the investigation. (shrink)

It is well known that Gödel’s incompleteness theorems hold for ∑1-definable theories containing Peano arithmetic. We generalize Gödel’s incompleteness theorems for arithmetically definable theories. First, we prove that every ∑n+1-definable ∑n-sound theory is incomplete. Secondly, we generalize and improve Jeroslow and Hájek’s results. That is, we prove that every consistent theory having ∏n+1set of theorems has a true but unprovable ∏nsentence. Lastly, we prove that no ∑n+1-definable ∑n-sound theory can prove its own ∑n-soundness. These three results are generalizations of Rosser’s (...) improvement of the first incompleteness theorem, Gödel’s first incompleteness theorem, and the second incompleteness theorem, respectively. (shrink)

Why, when asking oneself whether to believe that p, must one immediately recognize that this question is settled by, and only by, answering the question whether p is true? Truth is not an optional end for first-personal doxastic deliberation, providing an instrumental or extrinsic reason that an agent may take or leave at will. Otherwise there would be an inferential step between discovering the truth with respect to p and determining whether to believe that p, involving a bridge premise that (...) it is good (in whichever sense of good one likes, moral, prudential, aesthetic, allthings-considered, etc.) to believe the truth with respect to p. But there is no such gap between the two questions within the first-personal deliberative perspective; the question whether to believe that p seems to collapse into the question whether p is true. (shrink)

When we deliberate whether to believe some proposition, we feel immediately compelled to look for evidence of its truth. Philosophers have labelled this feature of doxastic deliberation 'transparency'. I argue that resolving the disagreement in the ethics of belief between evidentialists and pragmatists turns on the correct explanation of transparency. My hypothesis is that it reflects a conceptual truth about belief: a belief that p is correct if and only if p. This normative truth entails that only evidence can be (...) a reason for belief. Although evidentialism does not follow directly from the mere psychological truth that we cannot believe for non-evidential reasons, it does follow directly from the normative conceptual truth about belief which explains why we cannot do so. (shrink)

Akama et al. [1] systematically studied an arithmetical hierarchy of the law of excluded middle and related principles in the context of first-order arithmetic. In that paper, they first provide a prenex normal form theorem as a justification of their semi-classical principles restricted to prenex formulas. However, there are some errors in their proof. In this paper, we provide a simple counterexample of their prenex normal form theorem [1, Theorem 2.7], then modify it in an appropriate way which still serves (...) to largely justify the arithmetical hierarchy. In addition, we characterize a variety of prenex normal form theorems by logical principles in the arithmetical hierarchy. The characterization results reveal that our prenex normal form theorems are optimal. For the characterization results, we establish a new conservation theorem on semi-classical arithmetic. The theorem generalizes a well-known fact that classical arithmetic is $\Pi _2$ -conservative over intuitionistic arithmetic. (shrink)

We systematically study several principles and give a principle which is weaker than disjunctive Markov’s principle. We also show that the principle is underivable and strictly weaker than MP∨ in certain extensions of the system EL of elementary analysis.

We refine the arithmetical hierarchy of various classical principles by finely investigating the derivability relations between these principles over Heyting arithmetic. We mainly investigate some restricted versions of the law of excluded middle, De Morgan's law, the double negation elimination, the collection principle and the constant domain axiom.

The COVID-19 pandemic has shaken the world. After liberalization in 1991, microfinance became a panacea for poor people without collateral and information asymmetry. The higher cost of microfinance and debt traps highlighted the need for the state to intervene in resource redistribution. In addition, national lockdowns and COVID-19 restrictions have made it difficult for emerging economies like India to achieve this sustainable development goal. The Reserve Bank of India introduced self-help group (SHG) bank linkage to ensure the financial inclusion of (...) the poor. The difference-in-difference method examined how SHGs affect entrepreneur households’ income. CMIE Consumer Pyramid dx data were used for analysis. The data establish that SHGs have increased the income of the households, and demographic factors such as education, income level and gender also impact the financial inclusion of the poor. (shrink)

In this collection on the Kyoto School of Philosophy, the author offers the reader Tanabe's religious philosophy, but also, and for the first time, his ...

The uniform continuity theorem states that every pointwise continuous real‐valued function on the unit interval is uniformly continuous. In constructive mathematics, is strictly stronger than the decidable fan theorem, but Loeb [17] has shown that the two principles become equivalent by encoding continuous real‐valued functions as type‐one functions. However, the precise relation between such type‐one functions and continuous real‐valued functions (usually described as type‐two objects) has been unknown. In this paper, we introduce an appropriate notion of continuity for a modulus (...) of a continuous real‐valued function on [0, 1], and show that real‐valued functions with continuous moduli are exactly those functions induced by Loeb's codes. Our characterisation relies on two assumptions: (1) real numbers are represented by regular sequences (equivalently Cauchy sequences with explicitly given moduli); (2) the continuity of a modulus is defined with respect to the product metric on the regular sequences inherited from the Baire space. Our result implies that is equivalent to the statement that every pointwise continuous real‐valued function on [0, 1] with a continuous modulus is uniformly continuous. We also show that is equivalent to a similar principle for real‐valued functions on the Cantor space. These results extend Berger's [2] characterisation of for integer‐valued functions on and unify some characterisations of in terms of functions having continuous moduli. (shrink)

As Descartes famously pointed out in theSecond Meditation,the thought that someone is thinking is true anytime anyone thinks it. Furthermore, thinking it makes it true. Conversely, anytime anyone thinks that it is not the case that someone is thinking, this thought is false, and thinking it makes it false.l will argue that the propositions ‘There is at least one true normative proposition’ and ‘There are no true normative propositions’ have very similar properties. The proposition ‘There is at least one true (...) normative proposition,’ like the proposition ‘Someone is thinking,’ is true anytime anyone believes it, and, in an important sense, it is made true by someone's believing it. Conversely, anytime anyone believes that there are no true normative propositions, the proposition he believes is false and his believing it makes it false. (shrink)

Taylor and Francis Ltd TSEP_A_151217.sgm..

Some formal properties of enriched systems of Lambek calculus with analogues of conjunction and disjunction are investigated. In particular, it is proved that the class of languages recognizable by the Lambek calculus with added intersective conjunction properly includes the class of finite intersections of context-free languages.

We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic $\mathsf {PA}$ and intuitionistic arithmetic $\mathsf {HA}$. Using a generalized negative translation, we first provide a structured proof of the fact that $\mathsf {PA}$ is $\Pi _{k+2}$ -conservative over $\mathsf {HA} + {\Sigma _k}\text {-}\mathrm {LEM}$ where ${\Sigma _k}\text {-}\mathrm {LEM}$ is the axiom scheme of the law-of-excluded-middle restricted to formulas in $\Sigma _k$. In addition, we show that this conservation theorem is optimal in the (...) sense that for any semi-classical arithmetic T, if $\mathsf {PA}$ is $\Pi _{k+2}$ -conservative over T, then ${T}$ proves ${\Sigma _k}\text {-}\mathrm {LEM}$. In the same manner, we also characterize conservation theorems for other well-studied classes of formulas by fragments of classical axioms or rules. This reveals the entire structure of conservation theorems with respect to the arithmetical hierarchy of classical principles. (shrink)

Akama et al. [1] introduced a hierarchical classification of first-order formulas for a hierarchical prenex normal form theorem in semi-classical arithmetic. In this paper, we give a justification for the hierarchical classification in a general context of first-order theories. To this end, we first formalize the standard transformation procedure for prenex normalization. Then we show that the classes $$\textrm{E}_k$$ and $$\textrm{U}_k$$ introduced in [1] are exactly the classes induced by $$\Sigma _k$$ and $$\Pi _k$$ respectively via the transformation procedure in (...) any first-order theory. (shrink)

We identify bar recursion on moduli of continuity as a fundamental notion of constructive mathematics. We show that continuous functions from the Baire space \ to the natural numbers \ which have moduli of continuity with bar recursors are exactly those functions induced by Brouwer operations. The connection between Brouwer operations and bar induction allows us to formulate several continuity principles on the Baire space stated in terms of bar recursion on continuous moduli which naturally characterise some variants of bar (...) induction. These principles state that a certain kind of continuous function from \ to \ admits a modulus of continuity with a bar recursor. The results for the Baire space are recast in the setting of the Cantor space \ using the notion of fan recursor, a bar recursor for binary trees. This yields characterisations of uniformly continuous functions on the Cantor space and fan theorem in terms of fan recursors. The results for the Cantor space hold over the extensional version of intuitionistic arithmetic in all finite types ), and those for the Baire space hold over \ extended with the type for Brouwer operations. Our work places Spector’s bar recursion in a proper context of Brouwer’s intuitionistic mathematics and clarifies the connection between bar recursion and bar induction. (shrink)

Along the line of Hirst‐Mummert and Dorais, we analyze the relationship between the classical provability of uniform versions Uni(S) of Π2‐statements S with respect to higher order reverse mathematics and the intuitionistic provability of S. Our main theorem states that (in particular) for every Π2‐statement S of some syntactical form, if its uniform version derives the uniform variant of over a classical system of arithmetic in all finite types with weak extensionality, then S is not provable in strong semi‐intuitionistic systems (...) including bar induction in all finite types but also nonconstructive principles such as Kőnig's lemma and uniform weak Kőnig's lemma. Our result is applicable to many mathematical principles whose sequential versions imply. (shrink)

Estrogen receptor α (ERα) is a ligand‐dependent transcription factor that regulates the expression of estrogen‐responsive genes. Approximately 70% of patients with breast cancer are ERα positive. Estrogen stimulates cancer cell proliferation and contributes to tumor progression. Endocrine therapies, which suppress the ERα signaling pathway, significantly improve the prognosis of patients with breast cancer. However, the development of de novo or acquired endocrine therapy resistance remains a barrier to breast cancer treatment. Therefore, understanding the regulatory mechanisms of ERα is essential to (...) overcome the resistance to treatment. This review focuses on the regulation of ERα expression, including copy number variation, epigenetic regulation, transcriptional regulation, and stability, as well as functions from the point of view post‐translational modifications. (shrink)

Second-order abstract categorial grammars (de Groote in Association for computational linguistics, 39th annual meeting and 10th conference of the European chapter, proceedings of the conference, pp. 148–155, 2001) and hyperedge replacement grammars (Bauderon and Courcelle in Math Syst Theory 20:83–127, 1987; Habel and Kreowski in STACS 87: 4th Annual symposium on theoretical aspects of computer science. Lecture notes in computer science, vol 247, Springer, Berlin, pp 207–219, 1987) are two natural ways of generalizing “context-free” grammar formalisms for string and tree (...) languages. It is known that the string generating power of both formalisms is equivalent to (non-erasing) multiple context-free grammars (Seki et al. in Theor Comput Sci 88:191–229, 1991) or linear context-free rewriting systems (Weir in Characterizing mildly context-sensitive grammar formalisms, University of Pennsylvania, 1988). In this paper, we give a simple, direct proof of the fact that second-order ACGs are simulated by hyperedge replacement grammars, which implies that the string and tree generating power of the former is included in that of the latter. The normal form for tree-generating hyperedge replacement grammars given by Engelfriet and Maneth (Graph transformation. Lecture notes in computer science, vol 1764. Springer, Berlin, pp 15–29, 2000) can then be used to show that the tree generating power of second-order ACGs is exactly the same as that of hyperedge replacement grammars. (shrink)