In this paper, illocutionary acts of commanding will be differentiated from perlocutionary acts that affect preferences of addressees in a new dynamic logic which combines the preference upgrade introduced in DEUL (dynamic epistemic upgrade logic) by van Benthem and Liu with the deontic update introduced in ECL II (eliminative command logic II) by Yamada. The resulting logic will incorporate J. L. Austin’s distinction between illocutionary acts as acts having mere conventional effects and perlocutionary acts as acts having real effects (...) upon attitudes and actions of agents, and help us understand why saying so can make it so in explicit performative utterances. We will also discuss how acts of commanding give rise to so-called “deontic dilemmas” and how we can accommodate most deontic dilemmas without triggering so-called “deontic explosion”. (shrink)

In his previous work, the author has introduced the axiom schema of inductive dichotomy, a weak variant of the axiom schema of inductive definition, and used this schema for elementary ) positive operators to separate open and clopen determinacies for those games in which two players make choices from infinitely many alternatives in various circumstances. Among the studies on variants of inductive definitions for bounded ) positive operators, the present article investigates inductive dichotomy for these operators, and applies it to (...) constructive investigations of variants of determinacy statements for those games in which the players make choices from only finitely many alternatives. As a result, three formulations of open determinacy, that are all classically equivalent with each other, are equivalent to three different semi-classical principles, namely Markov’s Principle, Lesser Limited Principle of Omniscience and Limited Principle of Omniscience, over a suitable constructive base theory that proves clopen determinacy. Open and clopen determinacies for these games are thus separated. Some basic results on variants of inductive definitions for \ positive operators will also be given. (shrink)

Truth is often considered to be a logico-linguistic tool for expressing indirect endorsements and infinite conjunctions. In this article, I will point out another logico-linguistic function of truth: to enable and validate what I call a blind argument, namely, an argument that involves indirectly endorsed statements. Admitting this function among the logico-linguistic functions of truth has some interesting consequences. In particular, it yields a new type of so-called conservativeness argument, which poses a new type of threat to deflationism about truth.

Deflationism about truth describes truth as a logical notion. In the present paper, I explore the implication of the alleged logicality of truth from the perspective of axiomatic theories of truth, and argue that the deflationist doctrine of the logicality of truth gives rise to two types of self-undermining arguments against deflationism, which I call the conservativeness argument from logicality and the topic-neutrality argument.

We introduce a new axiom called inductive dichotomy, a weak variant of the axiom of inductive definition, and analyze the relationships with other variants of inductive definition and with related axioms, in the general second order framework, including second order arithmetic, second order set theory and higher order arithmetic. By applying these results to the investigations on the determinacy axioms, we show the following. (i) Clopen determinacy is consistency-wise strictly weaker than open determinacy in these frameworks, except second order arithmetic; (...) this is an enhancement of Schweber–Hachtman separation of open and clopen determinacy into the consistency-wise separation. (ii) Hausdorff–Kuratowski hierarchy of differences of opens is faithfully reflected by the hierarchy of consistency strengths of corresponding parameter-free determinacies in the aforementioned frameworks; this result is valid also in second order arithmetic only except clopen determinacy. (shrink)

We consider two variants of transfinite induction, one with monotonicity assumption on the predicate and one with the induction hypothesis only for cofinally many below. The latter can be seen as a transfinite analogue of the successor induction, while the usual transfinite induction is that of cumulative induction. We calculate the supremum of ordinals along which these schemata for \ formulae are provable in \. It is shown to be larger than the proof-theoretic ordinal \ by power of base 2. (...) We also show a similar result for the structural transfinite induction, defined with fundamental sequences. (shrink)

The conservativeness argument poses a dilemma to deflationism about truth, according to which a deflationist theory of truth must be conservative but no adequate theory of truth is conservative. The debate on the conservativeness argument has so far been framed in a specific formal setting, where theories of truth are formulated over arithmetical base theories. I will argue that the appropriate formal setting for evaluating the conservativeness argument is provided not by theories of truth over arithmetic but by those over (...) subject matters ‘richer’ than arithmetic, such as set theory. The move to this new formal setting provides deflationists with better defence and brings a broader perspective to the debate. (shrink)

In this article we study the systems KF and VF of truth over set theory as well as related systems and compare them with the corresponding systems over arithmetic.

This article reports that some robustness of the notions of predicativity and of autonomous progression is broken down if as the given infinite total entity we choose some mathematical entities other than the traditionalω. Namely, the equivalence between normal transfinite recursion scheme and newdependent transfinite recursionscheme, which does hold in the context of subsystems of second order number theory, does not hold in the context of subsystems of second order set theory where the universeVof sets is treated as the given (...) totality. (shrink)

This paper studies several systems of the transfinite iteration and autonomous progression of self-applicable truth and determines their proof-theoretic strength.

This article studies three most basic systems of truth as well as their subsystems over set theory ZF possibly with AC or the axiom of global choice GC, and then correlates them with subsystems of Morse–Kelley class theory MK. The article aims at making an initial step towards the axiomatic study of truth in set theory in connection with class theory. Some new results on the side of class theory, such as conservativity, forcing and some forms of the reflection principle, (...) are also presented. The equivalence results among systems of truth and classes obtained in this article are summarized in Theorem 104 , Theorem 107 and Theorem 108. (shrink)

Roelcke non-precompactness, simplicity, and non-amenability of the automorphism group of the Fraïssé limit of finite Heyting algebras are proved among others.

The present paper suggests relative truth definability as a tool for comparing conceptual aspects of axiomatic theories of truth and gives an overview of recent developments of axiomatic theories of truth in the light of it. We also show several new proof-theoretic results via relative truth definability including a complete answer to the conjecture raised by Feferman in [13].

We introduce and analyze a new axiomatic theory$\mathsf {CD}$of truth. The primitive truth predicate can be applied to sentences containing the truth predicate. The theory is thoroughly classical in the sense that$\mathsf {CD}$is not only formulated in classical logic, but that the axiomatized notion of truth itself is classical: The truth predicate commutes with all quantifiers and connectives, and thus the theory proves that there are no truth value gaps or gluts. To avoid inconsistency, the instances of the T-schema are (...) restricted todeterminatesentences. Determinateness is introduced as a further primitive predicate and axiomatized. The semantics and proof theory of$\mathsf {CD}$are analyzed. (shrink)

Although dual-process or divided-mind models of self-control dominate the literature, they suffer from empirical and conceptual challenges. We propose an alternative approach, suggesting that self-control can be characterized by a fragmented part versus integrated whole dynamic. Whereas responses to events derived from fragmented parts of the mind undermine self-control, responses to events derived from integrated wholes enhance self-control. We review empirical evidence from psychology and related disciplines that support this model. We, moreover, discuss the implications of this work for psychology, (...) neuroscience, economics, and philosophy. In particular, we highlight how this model addresses many of the conceptual and empirical short-comings of divided-mind models. We suggest that understanding self-control as the interplay between fragmented parts versus integrated wholes, moreover, provides novel insights and testable new hypotheses. (shrink)

Audrito and Viale introduced the new large cardinal notion of an (α)‐uplifting cardinal (for an ordinal α). We shall show that this notion cannot be defined (or expressed) in the standard first‐order language of set theory for every tranfinite α.

We introduce a Gentzen style formulation of Basic Propositional Calculus(BPC), the logic that is interpreted in Kripke models similarly tointuitionistic logic except that the accessibility relation of eachmodel is not necessarily reflexive. The formulation is presented as adual-context style system, in which the left hand side of a sequent isdivided into two parts. Giving an interpretation of the sequents inKripke models, we show the soundness and completeness of the system withrespect to the class of Kripke models. The cut-elimination theorem isproved (...) in a syntactic way by modifying Gentzen's method. Thisdual-context style system exemplifies the effectiveness of dual-contextformulation in formalizing various non-classical logics. (shrink)

Prediction is essential for the efficiency of many cognitive processes; however, this process is not always perfect. Predictive coding theory suggests that the brain generates and updates a prediction to respond to an upcoming event. Although an electrophysiological index of prediction, the stimulus preceding negativity, has been reported, it remains unknown whether the SPN reflects the prediction accuracy, or whether it is associated with the prediction error, which corresponds to a mismatch between a prediction and an actual input. Thus, the (...) present study aimed to investigate this question using electroencephalography. Participants were asked to predict the original pictures from pictures that had undergone different levels of pixelation. The SPN amplitude was affected by the level of pixelation and correlated with the subjective evaluation of the prediction accuracy. Furthermore, late positive components were negatively correlated with SPN. These results suggest that the amplitude of SPN reflects the prediction accuracy; more accurate prediction increases the SPN and reduces the prediction error, resulting in reduced LPC amplitudes. (shrink)

世界的な貧困や格差を前に、私たちはどんな正義を構想できるのだろうか。民主主義的な実践に根ざした新しい政治理論がここに誕生。 グローバルな正義を机上の空論で終わらせないために近年主張されているのが、「実践によって媒介された関係」に基づく正義論、つまり実践依存アプローチだ。サンジョヴァンニやウォルツァーなどによるこの理論をさら にアップデートすべく、NGOや社会運動といった主体を取り入れ、「集合的主体による実践依存アプローチ」の正義論を構想する。.

SOCREAL 2007: International Workshop on Philosophy and Ethics of Social Reality. Sapporo, Japan, 2007-03-09/10. Session 2: Logical Dynamics of Social Interaction.

An emerging perspective on human cognition and performance sees it as a kind of self-organizing phenomenon involving dynamic coordination across the body, brain and environment. Measuring this coordination faces a major challenge. Time series obtained from such cognitive, behavioral, and physiological coordination are often complicated in terms of non-stationarity and non-linearity, and in terms of continuous vs. categorical scales. Researchers have proposed several analytical tools and frameworks. One method designed to overcome these complexities is recurrence quantification analysis, developed in the (...) study of non-linear dynamics. It has been applied in various domains, including linguistic data or motion data. However, most previous studies have applied recurrence methods individually to categorical or continuous data. To understand how complex coordination works, an integration of these types of behavior is needed. We aimed to integrate these methods to investigate the relationship between language and motion directly. To do so, we added temporal information to categorical data, and applied joint recurrence analysis methods to visualize and quantify speech-motion coordination coupling during a rap performance. We illustrate how new dynamic methods may capture this coordination in a small case-study design on this expert rap performance. We describe a case study suggesting this kind of dynamic analysis holds promise, and end by discussing the theoretical implications of studying complex performances of this kind as a dynamic, coordinated phenomenon. (shrink)

A new research project has, quite recently, been launched to clarify how different, from systems in second order number theory extending ACA0, those in second order set theory extending NBG are. In this article, we establish the equivalence between Δ01-LFP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^1_0\mbox{\bf-LFP}}$$\end{document} and Δ01-FP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^1_0\mbox{\bf-FP}}$$\end{document}, which assert the existence of a least and of a fixed point, respectively, for positive elementary operators. Our proof also shows (...) the equivalence between ID1 and ID^1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\widehat{\it ID}_1}$$\end{document}, both of which are defined in the standard way but with the starting theory PA replaced by ZFC. (shrink)

Classes are the objects of the second sort of second-order set theory. They have sets as their members and behave like sets, but paradoxes tell us that many classes cannot be sets. Then, what are classes? Predicativism about classes suggests that classes are predicates of sets, and this article investigates the question from the predicativist point of view in light of recent developments in the use of classes in set theory. Predicativism has been considered too restrictive and unable to accommodate (...) the use of classes in set theory. This diagnosis, however, is only true of a certain specific type of predicativism. In this article, we propose a new type of predicativism, which we call liberal predicativism, and argue that predicativism is still a highly viable option, and our liberal version provides a sufficiently versatile and workable nominalist concept of classes for set theory. (shrink)

We measure, in the presence of the axiom of infinity, the proof-theoretic strength of the axioms of set theory which make the theory look really like a “theory of sets”, namely, the axiom of extensionality Ext, separation axioms and the axiom of regularity Reg . We first introduce a weak weak set theory as a base over which to clarify the strength of these axioms. We then prove the following results about proof-theoretic ordinals:1. and ,2. and . We also show (...) that neither Reg nor affects the proof-theoretic strength, i.e., where T is Basic plus any combination of Ext and. (shrink)

We introduce a new simple way of defining the forcing method that works well in the usual setting under FA, the Foundation Axiom, and moreover works even under Aczel's AFA, the Anti-Foundation Axiom. This new way allows us to have an intuition about what happens in defining the forcing relation. The main tool is H. Friedman's method of defining the extensional membership relation ∈ by means of the intensional membership relation ε .Analogously to the usual forcing and the usual generic (...) extension for FA-models, we can justify the existence of generic filters and can obtain the Forcing Theorem and the Minimal Model Theorem with some modifications. These results are on the line of works to investigate whether model theory for AFA-set theory can be developed in a similar way to that for FA-set theory.Aczel pointed out that the quotient of transition systems by the largest bisimulation and transition relations have the essentially same theory as the set theory with AFA. Therefore, we could hope that, by using our new method, some open problems about transition systems turn out to be consistent or independent. (shrink)

Crispin Wright in his 1982 paper argues for strict finitism, a constructive standpoint that is more restrictive than intuitionism. In its appendix, he proposes models of strict finitistic arithmetic. They are tree-like structures, formed in his strict finitistic metatheory, of equations between numerals on which concrete arithmetical sentences are evaluated. As a first step towards classical formalisation of strict finitism, we propose their counterparts in the classical metatheory with one additional assumption, and then extract the propositional part of ‘strict finitistic (...) logic’ from it and investigate. We will provide a sound and complete pair of a Kripke-style semantics and a sequent calculus, and compare with other logics. The logic lacks the law of excluded middle and Modus Ponens and is weaker than classical logic, but stronger than any proper intermediate logics in terms of theoremhood. In fact, all the other well-known classical theorems are found to be theorems. Finally, we will make an observation that models of this semantics can be seen as nodes of an intuitionistic model. (shrink)

We present an annotation scheme describing the argument structure of judgement documents, a central construct in Japanese law. To support the final goal of this work, namely summarisation aimed at the legal professions, we have designed blueprint models of summaries of various granularities, and our annotation model in turn is fitted around the information needed for the summaries. In this paper we report results of a manual annotation study, showing that the annotation is stable. The annotated corpus we created contains (...) 89 documents. We also designed and implemented the first two stages of an algorithm for the automatic extraction of argument structure, and present evaluation results. (shrink)

BackgroundSocial cognitive impairments adversely affect social functioning in patients with schizophrenia. Although pharmacological interventions have been suggested to provide some benefits on social cognition, little information is available on the comparative efficacy of pharmacotherapy. Thus, the aim of this planned systematic review and network meta-analysis is to perform a quantitative comparison of the effects of various psychotropic drugs, including supplements, on social cognition disturbances of schizophrenia.MethodsThe literature search will be carried out using the PubMed, Embase, Cochrane Central Register of Controlled (...) Trials, PsycINFO, ClinicalTrials.gov, and International Clinical Trials Registry Platform databases from inception onward. Randomized controlled trials that examined the efficacy of drugs in social cognitive disturbances will be included, based on the most recent studies and the broader literature than previously searched. This protocol defines a priori the methods that will be used for study selection, data collection, quality assessment, and statistical syntheses.DiscussionThe findings this work are expected to help promote the development of better therapeutics of social cognitive impairments in schizophrenia and related psychiatric conditions.Systematic Review Registration[www.crd.york.ac.uk/prospero], identifier [CRD42021293224]. (shrink)

Second-order arithmetic and class theory are second-order theories of mathematical subjects of foundational importance, namely, arithmetic and set theory. Despite the similarity in appearance, there turned out to be significant mathematical dissimilarities between them. The present paper studies various principles in class theory, from such a comparative perspective between second-order arithmetic and class theory, and presents a few new dissimilarities between them.

By forcing, we give a direct interpretation of into Avigad's. To the best of the author's knowledge, this is one of the simplest applications of forcing to “real problems”.