There is good reason to think that, in every case of perceptual consciousness, there is something of which we are conscious; but there is also good reason to think that, in some cases of perceptual consciousness—for instance, hallucinations—there is nothing of which we are conscious. This paper resolves this inconsistency—which we call the presentation problem—by (a) arguing that ‘conscious of’ and related expressions function as intensional transitive verbs and (b) defending a particular semantic approach to such verbs, on which (...) they have readings that lack direct objects or themes. The paper further argues that this approach serves not only as a linguistic proposal about the semantics of ‘conscious of’, but also as a proposal about the metaphysics of conscious states. (shrink)

This paper gives an outline of truthmaker semantics for natural language against the background of standard possible-worlds semantics. It develops a truthmaker semantics for attitude reports and deontic modals based on an ontology of attitudinal and modal objects and on a semantic function of clauses as predicates of such objects. It also présents new motivations for 'object-based truthmaker semantics' from intensional transitive verbs such as ‘need’, ‘look for’, ‘own’, and ‘buy’ and gives an outline of their semantics. This paper (...) is a commissioned 'target' article, with commentaries by W. Davis, B. Arsenijevic, K. Moulton, K. Liefke, M. Kaufmann, R. Matthews, P. Portner and A. Rubinstein, P. Elliott, G. Ramchand and my reply. (shrink)

This essay examines the grammatical structure underlying the use of the word "conscious". Despite the existence of this grammatical structure, I reject the assumption that actual consciousness has a similar structure. Specifically, I reject the claim that consciousness consists of three subtypes: state consciousness, transitive consciousness, and creature consciousness. I offer an inductive argument and a deductive argument that no such psychological entities exist. The inductive argument: given the lack of evidence or arguments for the entities and given that (...) a tripartite consciousness structure evolved from a tripartite grammatical habit, it would be far too coincidental if the grammatical distinction mirrored a psychological distinction. The deductive argument shows that absurd conclusions follow from assuming the existence of three distinct psychological entities. Furthermore, the verbal habits that motivate the distinction are rendered more intelligible under a "Unitary Thesis", the idea that verbal distinctions involving use of the word "conscious" are unified in their reliance on a single ontological unit, that of conscious experience. (shrink)

Among other virtues, Mental Files Theory provides a straightforward explanation of de jure coreference, i.e. identity of referent guaranteed by meaning alone: de jure coreference holds between terms when these are associated with the same mental file from which they inherit their reference. In this paper, I discuss an objection that Angel Pinillos raises against Mental Files Theory and other similar theories: the theory predicts that de jure coreference should be transitive, just like identity. Yet there are cases, involving (...) ‘slash-terms’, in which transitivity fails, or so it seems. In his book Mental Files, Recanati replies that the mental files theorist can accommodate Pinillos’ exceptions by offering a refined model of merging files, the ‘partial merging’ model. While agreeing with Recanati on the need for such a model, I contend that, pace Recanati and Pinillos, de jure coreference is transitive even in the presence of slash-terms. I will first show that paradoxical consequences ensue if slash-terms are said to de jure corefer with several basic terms at once. Then, building on two different accounts Recanati gives of referential confusion, I will show that on both views, de jure coreference cannot hold because of the behaviour of confused slash-terms. I will conclude that, in Mental Files Theory, a slash-term can, at most, de jure corefer with only one basic term per context. (shrink)

In Brentano’s Philosophical System: Mind, Being, Value, Uriah Kriegel argues that Brentano’s work forms a “live philosophical program” (p. 14, italics omitted) that contemporary philosophy has much to learn from and that is promising and largely correct. To this end, Kriegel argues that Brentano’s notion of consciousness is the contemporary notion of phenomenal consciousness, that Brentano’s rejection of unconscious mentality is a grave mistake that can be fairly neatly excised from his overall view, and that Brentano’s notion of intentionality is (...) the contemporary notion of phenomenal intentionality. This paper raises some doubts about these claims, suggesting that Brentano’s notion of consciousness might more closely align with the contemporary notion of transitive consciousness than with that of phenomenal consciousness, that Brentano’s rejection of unconscious mentality cannot be so easily excised from his overall view but that it is not such a grave mistake, and that Brentano’s notion of intentionality may not be that of phenomenal intentionality but rather that of generic abountness. I wrap up by considering the extent to which we might agree with Kriegel that Brentano’s work forms a live philosophical program that contemporary philosophy has much to learn from. (shrink)

Transitive inference (TI) refers to social cognition that facilitates the discernment of unknown relationships between individuals using known relationships. It is extensively reported that TI evolves in animals living in a large group because TI could assess relative rank without deducing all dyadic relationships, which averts costly fights. The relationships in a large group become so complex that social cognition may not be developed adequately to handle such complexity. If members apply TI to all possible members in the group, (...) TI requires extremely highly developed cognitive abilities especially in a large group. Instead of developing cognitive abilities significantly, animals may apply simplified TI we call reference TI in this study as heuristic approaches. The reference TI allows members to recognize and remember social interactions only among a set of reference members rather than all potential members. Our study assumes that information processes in the reference TI comprises (1) the number of reference members based on which individuals infer transitively, (2) the number of reference members shared by the same strategists, and (3) memory capacity. We examined how information processes evolve in a large group using evolutionary simulations in the hawk–dove game. Information processes with almost any numbers of reference members could evolve in a large group as long as the numbers of shared reference member are high because information from the others’ experiences is shared. TI dominates immediate inference, which assesses relative rank on direct interactions, because TI could establish social hierarchy more rapidly applying information from others’ experiences. (shrink)

The problem of unification in a normal modal logic $L$ can be defined as follows: given a formula $\varphi$, determine whether there exists a substitution $\sigma$ such that $\sigma $ is in $L$. In this paper, we prove that for several non-symmetric non-transitive modal logics, there exists unifiable formulas that possess no minimal complete set of unifiers.

The role of foundation with respect to transitive closure in the Zermelo system Z has been investigated by Boffa; our aim is to explore the role of antifoundation. We start by showing the consistency of "Z antifoundation transitive closure" relative to Z (by a technique well known for ZF). Further, we introduce a "weak replacement principle" (deductible from antifoundation and transitive closure) and study the relations among these three statements in Z via interpretations. Finally, we give some (...) adaptations for ZF without infinity. (shrink)

Recent work has brought to prominence the idea that some utterances contain occurrences of noun phrases that not only corefer, but do so in a particularly guaranteed or explicit way—call such occurrences ‘de jure coreferential’. Studies of de jure coreference have considered both the characteristics of the relation, and its explanation. Pinillos (154(2):301–324, 2011) argues that de jure coreference is non-transitive, and uses this as part of his argument for a new semantic primitive explaining de jure coreference. In this (...) paper, I draw attention to a neglected distinction between de jure coreference and another kind of coreference with which it might easily be confused. I then consider Pinillos’s claim that de jure coreference is non-transitive, and conclude that even using Pinillos’s definition of de jure coreference, it is far from straightforward that he has demonstrated the non-transitivity of de jure coreference. I question whether Pinillos’s characterisation of de jure coreference is adequate, and offer a plausible alternative characterisation. I show that on this new characterisation, there is no evidence that the relation is non-transitive. (shrink)

I discuss the question: Is it possible to prepare, by purely thermodynamic means, an ensemble described by a quantum state having a definite phase relation between two component states which have never been in direct contact? Resolution of this question requires us to take explicit account of the nature of the correlations between the system and its thermal environment.

This paper tests a novel implication of the original version of prospect theory (Kahneman and Tversky, 1979): that choices may systematically violate transitivity. Some have interpreted this implication as a weakness, viewing it as an anomaly generated by the ‘editing phase’ of prospect theory which can be rendered redundant by an appropriate re-specification of the preference function. Although there is some existing evidence that transitivity fails descriptively, the particular form of non-transitivity implied by prospect theory is quite distinctive and hence (...) presents an ideal opportunity to expose that theory to test. An experiment is reported which reveals strong evidence of the predicted intransitivity. It is argued that the existence of this new form of non-transitive behaviour presents a fresh theoretical challenge to those seeking descriptively adequate theories of choice behaviour, and a particular challenge to those who seek explanations within the conventional economic paradigm of utility maximisation. (shrink)

There is a mistake in the definition of the covering criterion on page 6.

In this paper we first develop a logic independent account of relevant implication. We propose a stipulative denition of what it means for a multiset of premises to relevantly L-imply a multiset of conclusions, where L is a Tarskian consequence relation: the premises relevantly imply the conclusions iff there is an abstraction of the pair such that the abstracted premises L-imply the abstracted conclusions and none of the abstracted premises or the abstracted conclusions can be omitted while still maintaining valid (...) L-consequence. Subsequently we apply this denition to the classical logic consequence relation to obtain NTR-consequence, i.e. the relevant CL-consequence relation in our sense, and develop a sequent calculus that is sound and complete with regard to relevant CL-consequence. We present a sound and complete sequent calculus for NTR. In a next step we add rules for an object language relevant implication to the sequent calculus. The object language implication reflects exactly the NTR-consequence relation. One can see the resulting logic NTR-> as a relevant logic in the traditional sense of the word. By means of a translation to the relevant logic R, we show that the presented logic NTR is very close to relevance logics in the Anderson-Belnap-Dunn-Routley-Meyer tradition. However, unlike usual relevant logics, NTR is decidable for the full language, Disjunctive Syllogism and Adjunction are valid, and neither Modus Ponens nor the Cut rule are admissible. (shrink)

We show that given a finite, transitive and reflexive Kripke model 〈 W , ≼, ⟦ ⋅ ⟧ 〉 and $${w \in W}$$ , the property of being simulated by w (i.e., lying on the image of a literalpreserving relation satisfying the ‘forth’ condition of bisimulation) is modally undefinable within the class of S4 Kripke models. Note the contrast to the fact that lying in the image of w under a bi simulation is definable in the standard modal language (...) even over the class of K4 models, a fairly standard result for which we also provide a proof. We then propose a minor extension of the language adding a sequent operator $${\natural}$$ (‘tangle’) which can be interpreted over Kripke models as well as over topological spaces. Over finite Kripke models it indicates the existence of clusters satisfying a specified set of formulas, very similar to an operator introduced by Dawar and Otto. In the extended language $${{\sf L}^+ = {\sf L}^{\square\natural}}$$ , being simulated by a point on a finite transitive Kripke model becomes definable, both over the class of (arbitrary) Kripke models and over the class of topological S4 models. As a consequence of this we obtain the result that any class of finite, transitive models over finitely many propositional variables which is closed under simulability is also definable in L + , as well as Boolean combinations of these classes. From this it follows that the μ -calculus interpreted over any such class of models is decidable. (shrink)

The section of the collective monograph provides a comprehensive analysis of the digital information impact and political modernization on the formation of a holistic and high-quality image of transitive democracy. The technologies of implementing effective changes in the political system in the context of building the domestic and foreign policy image of a transitive state are revealed. The role of information and the impact of the digitalization process on it in the context of the formation of the image (...) of transitive democracy is studied. (shrink)

We prove that any positive elementary (least fixed point) induction expressing the negation of transitive closure on finite nondirected graphs requires at least two recursion variables.

The neural basis of developmental changes in transitive reasoning in parietal regions was examined, using voxel-based morphometry. Young adolescents and adults performed a transitive reasoning task, subsequent to undergoing anatomical magnetic resonance imaging brain scans. Behaviorally, adults reasoned more accurately than did the young adolescents. Neural results showed less grey matter density in superior parietal cortex in the adults than in the young adolescents, possibly due to a developmental period of synaptic pruning; improved performance in the reasoning task (...) was negatively correlated with grey matter density in superior parietal cortex in the adolescents, but not in the adult group; and the latter results were driven by the more difficult trials, requiring greater spatial manipulation. Taken together, the results support the idea that during development, regions in superior parietal cortex are fine-tuned, to support more robust spatial manipulation, resulting in gre... (shrink)

This paper aims to argue for, else illustrate the epistemological significance of the use of non transitive similarity relations, mapping only to "types", as methodologically being on a par with the use of transitive similarity relations (equivalence relations), mapping as well to "predicates". -/- In this paper the sketch of an exact but simple geometrical model of the above construct is followed by mentioning respective use cases for non transitive similarity relations from science and humanities. A well (...) known metaphysics example is elaborated along these lines to some extent. (shrink)

We consider the classification problem for several classes of countable structures which are “vertex-transitive”, meaning that the automorphism group acts transitively on the elements. We show that the classification of countable vertex-transitive digraphs and partial orders are Borel complete. We identify the complexity of the classification of countable vertex-transitive linear orders. Finally we show that the classification of vertex-transitive countable tournaments is properly above \ in complexity.

The present paper focuses on the heuristic selection process preceding the actual transitive reasoning process. A part of the difficulty of transitive reasoning lies in the selection of the relevant problem aspects. Two experiments are presented using the paradigm introduced by Markovits, Dumas, and Malfait (1995), in which children were asked to make “higher than” inferences about arrays of coloured blocks. In order to discriminate between genuine transitive inference and a simple strategy of relative position, Markovits et (...) al. interspersed white blocks with the coloured blocks, such that the relative position strategy leads to erroneous responses. However, we argue that the white blocks cause confusion due to their ambiguity, which interferes with the heuristic selection process. Two methodological adaptations were introduced, which are hypothesised to facilitate the selection process and improve transitive reasoning: (1) the white blocks were replaced by coloured blocks, and (2) a less abstract context was added to the experimental design. The colour manipulation leads to a clear increase in the use of a transitive strategy by 9-year-old children; 8-year-old children mainly used the relative position strategy. When adding a context story, 9-year-old children used the transitive strategy regardless of the colour of the interspersed blocks. The overall performance of 8-year-olds improved slightly. These results are interpreted as support for a dual-process model of transitive reasoning. (shrink)

For each natural number n we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than n and no strictly ascending chains. The case n=0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n=0$$\end{document} is the Gödel-Löb provability logic. Each logic is axiomatised by adding a single axiom to K4, and is shown to have the finite model property and be decidable. We then consider a number of (...) extensions of these logics, including restricting to reflexive frames to obtain a corresponding sequence of extensions of S4. When n=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n=1$$\end{document}, this gives the famous logic of Grzegorczyk, known as S4Grz, which is the strongest modal companion to intuitionistic propositional logic. A topological semantic analysis shows that the n-th member of the sequence of extensions of S4 is the logic of hereditarily n+1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n+1$$\end{document}-irresolvable spaces when the modality ◊\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Diamond $$\end{document} is interpreted as the topological closure operation. We also study the definability of this class of spaces under the interpretation of ◊\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Diamond $$\end{document} as the derived set operation. The variety of modal algebras validating the n-th logic is shown to be generated by the powerset algebras of the finite frames with cycle length bounded by n. Moreover each algebra in the variety is a model of the universal theory of the finite ones, and so is embeddable into an ultraproduct of them. (shrink)

Most studies examining children's understanding of transitive sentences focus on the morphosyntactic properties of the construction and ignore prosody. But adults use prosody in many different ways to interpret ambiguous sentences. In two studies we investigated whether 5-year-old German children use prosody to determine participant roles in object-first (OVS) sentences with novel verbs (i.e., whether they use prosodic marking to overrule word order as a cue). Results showed that children identify participant roles better in this atypically ordered construction when (...) sentences are realized with the marked, OVS-typical intonational pattern, especially in combination with case marking (Study 1). In a second study, we embedded these sentences into an appropriate discourse context. The results show that, even in the absence of any case marking, children understand participant roles when they are realized with the appropriate intonational pattern. These findings demonstrate that young children can use intonation to help identify participant roles in transitive sentences, at least in marked constructions such as the German object-first (OVS) construction. (shrink)

This paper contains a proof-theoretic account of unification in transitive reflexive modal logics, which means that the reasoning is syntactic and uses as little semantics as possible. New proofs of theorems on unification types are presented and these results are extended to negationless fragments. In particular, a syntactic proof of Ghilardi’s result that $\mathsf {S4}$ has finitary unification is provided. In this approach the relation between classical valuations, projective unifiers, and admissible rules is clarified.

Transitive inference is claimed to be “deductive”. Yet every group/species ever reported apparently uses it. We asked 58 adults to solve five-term transitive tasks, requiring neither training nor premise learning. A computer-based procedure ensured all premises were continually visible. Response accuracy and RT (non-discriminative nRT ) were measured as is typically done. We also measured RT confined to correct responses ( cRT ). Overall, very few typical transitive phenomena emerged. The symbolic distance effect never extended to premise (...) recall and was not at all evident for nRT ; suggesting the use of non-deductive end-anchor strategies. For overall performance, and particularly the critical B ? D inference, our findings indicate that deductive transitive inference is far more intellectually challenging than previously thought. Contrasts of our present findings against previous findings suggest at least two distinct transitive inference modes, with most research and most computational models to date targeting an associative mode rather than their desired deductive mode. This conclusion fits well with the growing number of theories embracing a “dual process” conception of reasoning. Finally, our differing findings for nRT versus cRT suggest that researchers should give closer consideration to matching the RT measure they use to the particular conception of transitive inference they pre-held. (shrink)

According to William Craig, the notion of explanatory priority is the Achilles' heel of Robert Adams' argument against Molinism. Specifically, Craig contends that (1) the notion of explanatory priority is employed equivocally in the argument; (2) Adams is guilty of conflating reasons and causes; and (3) one of the intermediate conclusions of the argument is invalidly inferred, as can be seen by a counterexample. I argue that Craig is mistaken on all counts, and that Adams' argument emerges unscathed.

Natural conditions are provided that are sufficient to ensure that causality as defined by approaches that use counterfactual dependence and structural equations will be transitive.