Counterfactuals have become an important area of interdisciplinary interest, especially in logic, philosophy of language, epistemology, metaphysics, psychology, decision theory, and even artificial intelligence. In this study, we propose a new form of analysis for counterfactuals: analysis by algorithmic complexity. Inspired by Lewis-Stalnaker's Possible Worlds Semantics, the proposed method allows for a new interpretation of the debate between David Lewis and Robert Stalnaker regarding the Limit and Singularity assumptions. Besides other results, we offer a new way to answer the problems (...) raised by Goodman and Quine regarding vagueness, context-dependence, and the non- monotonicity of counterfactuals. Engaging in a dialogue with literature, this study will seek to bring new insights and tools to this debate. We hope our method of analysis can make counterfactuals more understandable in an intuitively plausible way, and a philosophically justifiable manner, aligned with the way we usually think about counterfactual propositions and our imaginative reasoning. (shrink)

A new method for obtaining lower bounds on the computational complexity of logical theories is presented. It extends widely used techniques for proving the undecidability of theories by interpreting models of a theory already known to be undecidable. New inseparability results related to the well known inseparability result of Trakhtenbrot and Vaught are the foundation of the method. Their use yields hereditary lower bounds . By means of interpretations lower bounds can be transferred from one theory to another. Complicated machine (...) codings are replaced by much simpler definability considerations, viz., the kinds of binary relations definable with short formulas on large finite sets. Numerous examples are given, including new proofs of essentially all previously known lower bounds for theories, and lower bounds for various theories of finite trees, which turn out to be particularly useful. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...) and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal cognitivism and modal expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic two-dimensional semantics. Chapter \textbf{3} provides an abstraction principle for epistemic (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between the interpretational and objective modalities and truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals while bypassing the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...) and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal cognitivism and modal expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic two-dimensional semantics. Chapter \textbf{3} provides an abstraction principle for epistemic (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between the interpretational and objective modalities and truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals while bypassing the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

It is well understood and appreciated that Gödel’s Incompleteness Theorems apply to sufficiently strong, formal deductive systems. In particular, the theorems apply to systems which are adequate for conventional number theory. Less well known is that there exist algorithms which can be applied to such a system to generate a gödel-sentence for that system. Although the generation of a sentence is not equivalent to proving its truth, the present paper argues that the existence of these algorithms, when conjoined with Gödel’s (...) results and accepted theorems of recursion theory, does provide the basis for an apparent paradox. The difficulty arises when such an algorithm is embedded within a computer program of sufficient arithmetic power. The required computer program (an AI system) is described herein, and the paradox is derived. A solution to the paradox is proposed, which, it is argued, illuminates the truth status of axioms in formal models of programs and Turing machines. (shrink)

The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the relativity of mathematical languages used to describe the Turing machines. A deep investigation is performed on the interrelations between mechanical computations and their mathematical descriptions emerging when a human (the researcher) starts to describe a Turing machine (the object of the study) by (...) different mathematical languages (the instruments of investigation). Together with traditional mathematical languages using such concepts as ‘enumerable sets’ and ‘continuum’ a new computational methodology allowing one to measure the number of elements of different infinite sets is used in this paper. It is shown how mathematical languages used to describe the machines limit our possibilities to observe them. In particular, notions of observable deterministic and non-deterministic Turing machines are introduced and conditions ensuring that the latter can be simulated by the former are established. (shrink)

I propose to consider the question, "Can machines think?" This should begin with definitions of the meaning of the terms "machine" and "think." The definitions might be framed so as to reflect so far as possible the normal use of the words, but this attitude is dangerous, If the meaning of the words "machine" and "think" are to be found by examining how they are commonly used it is difficult to escape the conclusion that the meaning and the answer to (...) the question, "Can machines think?" is to be sought in a statistical survey such as a Gallup poll. But this is absurd. Instead of attempting such a definition I shall replace the question by another, which is closely related to it and is expressed in relatively unambiguous words. The new form of the problem can be described in terms of a game which we call the 'imitation game." It is played with three people, a man (A), a woman (B), and an interrogator (C) who may be of either sex. The interrogator stays in a room apart front the other two. The object of the game for the interrogator is to determine which of the other two is the man and which is the woman. He knows them by labels X and Y, and at the end of the game he says either "X is A and Y is B" or "X is B and Y is A." The interrogator is allowed to put questions to A and B. We now ask the question, "What will happen when a machine takes the part of A in this game?" Will the interrogator decide wrongly as often when the game is played like this as he does when the game is played between a man and a woman? These questions replace our original, "Can machines think?". (shrink)

Cognitive modules are internal mental structures. Some theorists and empirical researchers hypothesize that the human mind is either partially or massively comprised of structures that are modular in nature. Modules are also invoked to explain cognitive capacities associated with the performance of specific functional tasks. Jerry Fodor (1983) considered that modules are useful only for explaining relatively low-level systems (input systems). These are the systems involved in capacities like perception and language. For Fodor, the central (high-level) systems of mind — (...) those involved in capacities like judgment (the “fixation of belief” in Fodor’s jargon), planning (practical reasoning), decision-making, and so forth — are not explainable in terms of modular mechanisms. However, some other philosophers as well as proponents and practitioners of evolutionary psychology consider that it is sensible — and even necessary — to invoke modules for explaining these systems, too. Indeed, the debate over modularity is mainly a debate over the modularity of central systems (high-level cognitive capacities). Admittedly, it is also possible to raise doubts about the modularity of peripheral systems (Prinz, 2006), but this kind of skepticism is not widespread in the literature. In contrast, both the empirical and the theoretical (a priori) cases in favor of central modularity are usually contested on multiple fronts and in tough terms. The case for the modularity of central systems is the core of the case for the massive modularity of mind hypothesis (viz. the hypothesis that consists in asserting that both the peripheral and the central systems of human mind are largely composed of modules). Granted, the massive modularity of mind hypothesis is an empirical statement and, as such, its truth should be ultimately decided in an empirical way, not a priori (Sperber, 1994, 2001). Nonetheless, much of the debate over massive modularity has taken place on theoretical grounds. This is due to an alleged underdetermination of the hypotheses regarding the modularity of central systems by data. In such conditions, the remaining open option has been to advance theoretical considerations in favor of the plausibility — and not directly in favor of the empirical truth or truthlikeness — of the massive modularity of mind generally, and of the modularity of some central systems in particular. These theoretical considerations are mostly based on an adaptationist view of evolution cum a classical computationalist approach to mind. They include arguments about the nature and evolution of hierarchically ordered complex systems (the evolvability of complexity argument), a presumption of optimality expressed in the apparent design of phenotypic traits shaped by natural selection (the task-specificity argument) and dismissing nonmodular mental architectures as computationally intractable (the tractability argument). Is the massive modularity of mind hypothesis a cogent view about the ontological nature of human mind or is it, rather, an effective/ineffective adaptationist discovery heuristic for generating predictively successful hypothesis about both heretofore unknown psychological traits and unknown properties of already identified psychological traits? Considering the inadequacies of the case in favor of massive modularity as an ontological hypothesis, I suggest approaching and valuing massive modularity as an adaptationist discovery heuristic. (shrink)

This paper aims to offer a new view of the role of connectionist models in the study of human cognition through the conceptualization of the history of connectionism – from the simplest perceptrons to convolutional neural nets based on deep learning techniques, as well as through the interpretation of criticism coming from symbolic cognitive science. Namely, the connectionist approach in cognitive science was the target of sharp criticism from the symbolists, which on several occasions caused its marginalization and almost complete (...) abandonment of its assumptions in the study of cognition. Criticisms have mostly pointed to its explanatory inadequacy as a theory of cognition or to its biological implausibility as a theory of implementation, and critics often focused on specific shortcomings of some connectionist models and argued that they apply to connectionism in general. In this paper, we want to show that both types of critique are based on the assumption that the only valid explanations in cognitive science are instances of homuncular functionalism and that by removing this assumption and by adopting an alternative methodology – exploratory mechanistic strategy, we can reject most objections to connectionism as irrelevant, explain the progress of connectionist models despite their shortcomings and sketch the trajectory of their future development. By adopting mechanistic explanations and by criticizing functionalism, we will reject the objections of explanatory inadequacy, by characterizing connectionist models as generic rather than concrete mechanisms, we will reject the objections of biological implausibility, and by attributing the exploratory character to connectionist models we will show that practice of generalizing current to general failures of connectionism is unjustified. (shrink)

A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section I. (...) Many modifications of Turing machines cum quantum ones are researched in Section II for the Halting problem and completeness, and the model of two independent Turing machines seems to generalize them. Then, that pair can be postulated as the formal definition of reality therefore being complete unlike any of them standalone, remaining incomplete without its complementary counterpart. Representation is formal defined as a one-to-one mapping between the two Turing machines, and the set of all those mappings can be considered as “language” therefore including metaphors as mappings different than representation. Section III investigates that formal relation of “reality”, “representation”, and “language” modeled by (at least two) Turing machines. The independence of (two) Turing machines is interpreted by means of game theory and especially of the Nash equilibrium in Section IV. Choice and information as the quantity of choices are involved. That approach seems to be equivalent to that based on set theory and the concept of actual infinity in mathematics and allowing of practical implementations. (shrink)

A set theory model of reality, representation and language based on the relation of completeness and incompleteness is explored. The problem of completeness of mathematics is linked to its counterpart in quantum mechanics. That model includes two Peano arithmetics or Turing machines independent of each other. The complex Hilbert space underlying quantum mechanics as the base of its mathematical formalism is interpreted as a generalization of Peano arithmetic: It is a doubled infinite set of doubled Peano arithmetics having a remarkable (...) symmetry to the axiom of choice. The quantity of information is interpreted as the number of elementary choices (bits). Quantum information is seen as the generalization of information to infinite sets or series. The equivalence of that model to a quantum computer is demonstrated. The condition for the Turing machines to be independent of each other is reduced to the state of Nash equilibrium between them. Two relative models of language as game in the sense of game theory and as ontology of metaphors (all mappings, which are not one-to-one, i.e. not representations of reality in a formal sense) are deduced. (shrink)

The present PhD dissertation aims to examine the relation between modality and change in Aristotle’s metaphysics. -/- On the one hand, Aristotle supports his modal realism (i.e., worldly objects have modal properties - potentialities and essences - that ground the ascriptions of possibility and necessity) by arguing that the rejection of modal realism makes change inexplicable, or, worse, banishes it from the realm of reality. On the other hand, the Stagirite analyses processes by means of modal notions (‘change is the (...) actuality of what is virtual insofar as it is virtual’). In other words: to grasp what change is, one has to resort to the modal idiom of potentialities, while the fact that there is change is indicative of the fact that nature is full of modal properties. -/- Aristotle’s modal and kinetic realism finds a negative in the figure of the Megaric Diodorus Kronus. The polemical situation of Greek philosophy has indeed the dialectical advantage of not opposing the Aristotelian position to a sui generis straw man. Both in its reduction of modal judgements to temporal quantifications and in its dissolution of the reality of the state-of-being-in-motion in favour of a cinematographic view of processes, the philosophical figure of reductionist antirealism embodied by Diodorus constitutes an alternative that takes the opposite view of Aristotle’s realism. -/- The present study is structured as a discussion between these two positions. In the face of Diodorus’ antirealist challenges, Aristotle articulates modal and kinetic considerations: the answers he gives to Diodorus’ puzzles thus provide valuable insight into his metaphysics. Moreover, the examination of Aristotle’s and Diodorus’ metaphysics, because of their insight and originality, will not fail to interest the philosopher concerned with the metaphysical foundations of modern physics, insofar as the entanglement between modalities and processes is nowadays at the core of mechanics (phase spaces, path integrals, etc.). (shrink)

Quantum information is discussed as the universal substance of the world. It is interpreted as that generalization of classical information, which includes both finite and transfinite ordinal numbers. On the other hand, any wave function and thus any state of any quantum system is just one value of quantum information. Information and its generalization as quantum information are considered as quantities of elementary choices. Their units are correspondingly a bit and a qubit. The course of time is what generates choices (...) by itself, thus quantum information and any item in the world in final analysis. The course of time generates necessarily choices so: The future is absolutely unorderable in principle while the past is always well-ordered and thus unchangeable. The present as the mediation between them needs the well-ordered theorem equivalent to the axiom of choice. The latter guarantees the choice even among the elements of an infinite set, which is the case of quantum information. The concrete and abstract objects share information as their common base, which is quantum as to the formers and classical as to the latter. The general quantities of matter in physics, mass and energy can be considered as particular cases of quantum information. The link between choice and abstraction in set theory allows of “Hume’s principle” to be interpreted in terms of quantum mechanics as equivalence of “many” and “much” underlying quantum information. Quantum information as the universal substance of the world calls for the unity of physics and mathematics rather than that of the concrete and abstract objects and thus for a form of quantum neo-Pythagoreanism in final analysis. (shrink)

It is widely thought that chance should be understood in reductionist terms: claims about chance should be understood as claims that certain patterns of events are instantiated. There are many possible reductionist theories of chance, differing as to which possible pattern of events they take to be chance-making. It is also widely taken to be a norm of rationality that credence should defer to chance: special cases aside, rationality requires that one's credence function, when conditionalized on the chance-making facts, should (...) coincide with the objective chance function. It is a shortcoming of a theory of chance if implies that this norm of rationality is unsatisfiable. The primary goal of this paper is to show, on the basis of considerations concerning computability and inductive learning, that this shortcoming is more common than one would have hoped. (shrink)

This work presents a post-positivist research framework to explain any surprising fact in the evolutionary path of a complex, dynamic and contingent social phenomenon. Primarily, it reconciles the ontological and epistemological assumptions of Critical Realism with the principles of American Pragmatism. Then, the research approach is presented: theoretical propositions about a social structure are translated into a set of grammar rules that acknowledges a pattern of sequences of events of either individual action or social interaction between actors within a real (...) social system. The result is a discrete mathematical model for a concrete category of social process based on these rules. Finally, data-grounded refinement of the theory is possible by the comparison between cases belonging to the same category, but differing about some contingent pattern of sequences of event outcomes. Consequently, their grammars differ in some pairs of context-sensitive rules that can explain this surprising fact, such that the derivation of this alternative historical trajectory of event outcomes becomes an extension to the early category of social process. In this sense, the proposed framework suggests there is a hierarchy of classes of grammars for middle-range explanations based upon the ontological assumption of the generative nature of social reality. (shrink)

The Aristotelian origins of formal systems are outlined, together with Aristotle's use of causal terms in describing syllogisms. The precision and exactness of a formalism, based on the projection of logical forms into perceptive signs, is contrasted with foundational, abstract concepts, independent of any formalism, which are presupposed for the understanding of a formal language. The definition of a formal system by means of a Turing machine is put in the context of Wittgenstein's general considerations of a machine understood as (...) a sign. A modification of Łukasiewicz's logic Ł3 with the inclusion of justification terms is proposed in order to formally analyse some features of formalistic reasoning as a mechanical, causal affair within a wider context of "indeterminacy". (shrink)

SUMMARY Major theories of philosophical psychology and philosophy of mind are examined on the basis of the fundamental questions of ontology, metaphysics, epistemology, semantics and logic. The result is the choice between language of eliminative reductionism and dualism, neither of which answers properly the relation between mind and body. In the search for a non–dualistic and non–reductive language, Wittgenstein’s notion of language–games as the representative links between language and the world is considered together with Peirce’s semeiosis of cognition. The result (...) is a redefined notion of cognition as the goal–oriented ability to instantiate strategies from the rules of the language–games. Cognition is considered within the four-dimensional languagegames: rules/strategies, primitive/complete language-games, family-resemblances/forms of life, and non-temporal continuum as the language-games’ modality. Cognition is seen as a continuum process of non–individualized elements that unites perception, volition, emotion, will and thought against the commonly accepted understandings of cognition in exclusive terms of perception and thinking. The alternative to the mind/body problem is the continuity of cognition where rules and strategies, syntax and semantics, are considered inseparable within language–games. This continuity of cognition is explained in terms of virtual (univocal) identity, replacing the old philosophical paradigm of the mind/body problem. -/- SOMMARIO Le teorie maggiori della psicologia filosofica e filosofia della mente sono esaminate a partire dalle questioni fondamentali di ontologia, metafisica, epistemologia, semantica e logica. Il risultato è la scelta tra un linguaggio riduzionista eliminativo e un dualismo che però non confronta in modo adeguato la relazione tra mente e corpo. Nella ricerca per un linguaggio non-dualistico e non-riduttivo, viene considerata la nozione del gioco linguistico di Wittgenstein come un legame rappresentativo tra il linguaggio e il mondo insieme con la semiosi cognitiva di Peirce. Il risultato è la nozione ridefinita della cognizione come abilità goal-orientata di creare le strategie dalle regole dei giochi linguistici. La cognizione è considerata entro le quattro dimensioni dei giochi linguistici: regole/strategie, giochi linguistici primitivi/completi, somiglianze di famiglia/forme di vita, e la continuità atemporale come la modalità dei giochi linguistici. La cognizione diventa un processo continuo degli elementi non-individualizzati che tende ad unificare la percezione, volizione, emozione, la volontà e il pensiero contro un concetto generalmente accettato di vedere la cognizione nei termini esclusivamente di percezione e di pensiero. L’alternativa al problema della mente/corpo è la continuità della cognizione, dove le regole e le strategie, la sintassi e la semantica, sono considerate inseparabili nei giochi linguistici. Questa continuità della cognizione è spiegata nei termini dell’identità virtuale (univoca) sostituendo un paradigma filosofico previo del problema della mente/corpo. (shrink)

Perception solves computationally demanding problems at lightning fast speed. It recovers sophisticated representations of the world from degraded inputs, often in a matter of milliseconds. Any theory of perception must be able to explain how this is possible; in other words, it must be able to explain perception's computational tractability. One of the few attempts to move toward such an explanation has been the information encapsulation hypothesis, which posits that perception can be fast because it keeps computational costs low by (...) forgoing access to information stored in cognition. I argue that we have no compelling reason to believe that encapsulation explains (or even contributes to an explanation of) perceptual tractability, and much reason to doubt it. This is because there exist much deeper computational challenges for perception than information access, and these threaten to make the costs of access irrelevant. If this is right, it undermines a core computational motivation for encapsulation and sends us back to the drawing board for explanations of perceptual tractability. (shrink)

In the 70 years since Alan Turing’s ‘Computing Machinery and Intelligence’ appeared in Mind, there have been two widely-accepted interpretations of the Turing test: the canonical behaviourist interpretation and the rival inductive or epistemic interpretation. These readings are based on Turing’s Mind paper; few seem aware that Turing described two other versions of the imitation game. I have argued that both readings are inconsistent with Turing’s 1948 and 1952 statements about intelligence, and fail to explain the design of his game. (...) I argue instead for a response-dependence interpretation. This interpretation has implications for Turing’s view of free will: I argue that Turing’s writings suggest a new form of free will compatibilism, which I call response-dependence compatibilism. The philosophical implications of rethinking Turing’s test go yet further. It is assumed by numerous theorists that Turing anticipated the computational theory of mind. On the contrary, I argue, his remarks on intelligence and free will lead to a new objection to computationalism. (shrink)

Disertační práce se zabývá problematikou připisování myšlení jiným entitám, a to pomocí imitační hry navržené v roce 1950 britským filosofem Alanem Turingem. Jeho kritérium, známé v dějinách filosofie jako Turingův test, je podrobeno detailní analýze. Práce popisuje nejen původní námitky samotného Turinga, ale především pozdější diskuse v druhé polovině 20. století. Největší pozornost je věnována těmto kritikám: Lucasova matematická námitka využívající Gödelovu větu o neúplnosti, Searlův argument čínského pokoje konstatující nedostatečnost syntaxe pro sémantiku, Blockův návrh na použití brutální síly pro (...) řešení imitační hry, Frenchova teorie subkognitivních informací a Michieho skepticismus ohledně možnosti umělého vědomí. Závěr práce zachycuje současný stav recepce Turingova testu a představuje pokusy o jeho praktickou realizaci, například v každoroční soutěži o Loebnerovu cenu. Autor práce zastává názor, že ani po více než šedesáti letech od uveřejnění Turingova paradigmatického eseje stále neexistují žádné vážné důvody pro zamítnutí jeho tvrzení. Tradiční komputační funkcionalismus možná není ideální teorií vysvětlující činnost myslí a jako slibnější se může jevit vývoj v neurálních vědách, ale Turingův test je přesto užitečným a snad i jediným nástrojem pro detekci inteligence u lidmi vytvořených strojů. (shrink)

I develop a theory of counterfactuals about relative computability, i.e. counterfactuals such as 'If the validity problem were algorithmically decidable, then the halting problem would also be algorithmically decidable,' which is true, and 'If the validity problem were algorithmically decidable, then arithmetical truth would also be algorithmically decidable,' which is false. These counterfactuals are counterpossibles, i.e. they have metaphysically impossible antecedents. They thus pose a challenge to the orthodoxy about counterfactuals, which would treat them as uniformly true. What’s more, I (...) argue that these counterpossibles don’t just appear in the periphery of relative computability theory but instead they play an ineliminable role in the development of the theory. Finally, I present and discuss a model theory for these counterfactuals that is a straightforward extension of the familiar comparative similarity models. (shrink)

Three special issues of Entropy journal have been dedicated to the topics of “InformationProcessing and Embodied, Embedded, Enactive Cognition”. They addressed morphological computing, cognitive agency, and the evolution of cognition. The contributions show the diversity of views present in the research community on the topic of computation and its relation to cognition. This paper is an attempt to elucidate current debates on computation that are central to cognitive science. It is written in the form of a dialog between two authors (...) representing two opposed positions regarding the issue of what computation is and could be, and how it can be related to cognition. Given the different backgrounds of the two researchers, which span physics, philosophy of computing and information, cognitive science, and philosophy, we found the discussions in the form of Socratic dialogue appropriate for this multidisciplinary/cross-disciplinary conceptual analysis. We proceed as follows. First, the proponent (GDC) introduces the info-computational framework as a naturalistic model of embodied, embedded, and enacted cognition. Next, objections are raised by the critic (MM) from the point of view of the new mechanistic approach to explanation. Subsequently, the proponent and the critic provide their replies. The conclusion is that there is a fundamental role for computation, understood as information processing, in the understanding of embodied cognition. (shrink)

Today, artificial intelligence, especially machine learning, is structurally dependent on human participation. Technologies such as Deep Learning (DL) leverage networked media infrastructures and human-machine interaction designs to harness users to provide training and verification data. The emergence of DL is therefore based on a fundamental socio-technological transformation of the relationship between humans and machines. Rather than simulating human intelligence, DL-based AIs capture human cognitive abilities, so they are hybrid human-machine apparatuses. From a perspective of media philosophy and social-theoretical critique, I (...) differentiate five types of “media technologies of capture” in AI apparatuses and analyze them as forms of power relations between humans and machines. Finally, I argue that the current hype about AI implies a relational and distributed understanding of (human/artificial) intelligence, which I categorize under the term “cybernetic AI”. This form of AI manifests in socio-technological apparatuses that involve new modes of subjectivation, social control and discrimination of users. (shrink)

Öz: Frege özel adların (ve diğer dilsel simgelerin) anlamları ve gönderimleri arasında ünlü ayrımını yaptığı “Anlam ve Gönderim Üzerine” (1948) adlı makalesinde, bu ayrımın önemi, gerekliliği ve sonuçları üzerine uzun değerlendirmeler yapar ancak özel adın anlamından tam olarak ne anlaşılması gerektiğinden yalnızca bir dipnotta kısaca söz eder. Örneğin “Aristoteles” özel adının anlamının Platon’un öğrencisi ve Büyük İskender’in öğretmeni ya da Stagira’da doğan Büyük İskender’in öğretmeni olarak alınabileceğini söyler. Burada dikkat çeken nokta örnekteki özel adın olası anlamları olarak gösterilen belirli betimlemelerin (...) de özel ad içeriyor olması. Anlamın Frege için bileşimsel olduğu, bir başka deyişle bir dilsel simgenin anlamının (varsa) parçalarının anlamlarınca belirlendiği düşünülürse, örnekteki belirli betimlemelerin anlamlarının saptanabilmesi için içerdikleri özel adların da anlamları saptanıp betimleme içinde geçtikleri yere konmalıdır. Bu işlem hiçbir özel ad kalmayana kadar sürdürülmelidir. Ancak biraz düşünülünce bir özel adın nesnesini tekil olarak betimleyecek ve içinde özel ad geçmeyecek bir betimleme bulmanın kolay olmadığı görülür. Örneğin yukarıdaki betimlemelerde geçen “Platon”, “Büyük İskender” ve “Stagira” gibi özel adların anlamları olabilecek ancak özel ad içermeyen betimlemeler bulmak pek kolay görünmüyor. Ortaya bir sonsuz gerileme sorunu çıkmış gibi duruyor. Frege’nin anlam-gönderim ayrımını için ciddi sonuçları olabilecek bu sorunu Frege çözebilir mi? Bu yazıda bu sorunun yanıtını arayacağım. Sorunu betimledikten sonra Frege’nin önündeki seçenekleri (örneğin bağlama duyarlı terimlerden (gösterme adılları veya belirteçler) yararlanma veya bağlamı sınırlama gibi) değerlendireceğim. -/- Abstract: In his “Sense and Reference” (1948), Frege makes his famous distinction between the sense and the reference of a proper name (and other signs) and discusses at length the significance, necessity and consequences of the distinction, but he explains how the sense of a proper name should be understood very briefly in a footnote. According to him, for example, the sense of the proper name “Aristotle” can be taken as the pupil of Plato and teacher of Alexander the Great or the teacher of Alexander the Great who was born in Stagira. What is interesting here is that the definite descriptions given as the possible senses of this proper name do themselves contain proper names too. Since the sense is something compositional for Frege, which means the sense of a linguistic sign is determined by its constituents (if there are any), in order to determine the sense of definite descriptions in question, we should first determine the senses of proper names they contain and substitute these senses with the proper names themselves. This process should continue until no proper name remains. However, it does not seem easy to find a definite description which describes the object of a proper name uniquely but contains no proper name itself. For instance, could we find appropriate senses that contain no proper name for “Plato”, “Alexander the Great” and “Stagira”? It does not seem likely. A problem of infinite regress appears to arise. Can Frege solve this problem, which poses a serious threat for his sensereference distinction? I will explore this problem in this paper. After explaining the problem, I will discuss the options (e.g. turning to indexicals or context restriction) Frege can take to deal with it. (shrink)

Quantum computing is of high interest because it promises to perform at least some kinds of computations much faster than classical computers. Arute et al. 2019 (informally, “the Google Quantum Team”) report the results of experiments that purport to demonstrate “quantum supremacy” – the claim that the performance of some quantum computers is better than that of classical computers on some problems. Do these results close the debate over quantum supremacy? We argue that they do not. In the following, we (...) provide an overview of the Google Quantum Team’s experiments, then identify some open questions in the quest to demonstrate quantum supremacy. (shrink)

Provides a comprehensive overview and introduction to the Routledge Handbook of Propositions.

In this reply to James H. Fetzer’s “Minds and Machines: Limits to Simulations of Thought and Action”, I argue that computationalism should not be the view that (human) cognition is computation, but that it should be the view that cognition (simpliciter) is computable. It follows that computationalism can be true even if (human) cognition is not the result of computations in the brain. I also argue that, if semiotic systems are systems that interpret signs, then both humans and computers are (...) semiotic systems. Finally, I suggest that minds can be considered as virtual machines implemented in certain semiotic systems, primarily the brain, but also AI computers. In doing so, I take issue with Fetzer’s arguments to the contrary. (shrink)

Nykyaikaisen logiikan keskeisenä tutkimuskohteena ovat erilaiset formalisoidut teoriat. Erityisesti vuosisadan vaihteen aikoihin matematiikan perusteiden tutkimuksessa ilmaantuneiden hämmentävien paradoksien (Russell 1902, 1903) jälkeen (ks. kuitenkin jo Frege 1879, Dedekind 1888, Peano 1889; vrt. Wang 1957) keskeiset matemaattiset teoriat on pyritty tällaisten vaikeuksien välttämiseksi uudelleen muotoilemaan täsmällisesti keinotekoisessa symbolikielessä, jonka lauseenmuodostussäännöt on täsmällisesti ja yksikäsitteisesti määrätty. Edelleen teoriat on pyritty aksiomatisoimaan, ts. on pyritty antamaan joukko peruslauseita, joista kaikki muut - tai ainakin mahdollisimman monet - teorian todet lauseet voidaan loogisesti johtaa tarkoin (...) määrättyjen päättelysääntöjen mukaisesti (erityisesti Hilbert 1904, 1918, 1927; ks. myös Russell 1908, Zermelo 1908; vrt. Kleene 1952, §§ 14−15). (shrink)

This book contains a representationalist theory of self-consciousness and of the phenomenal first-person perspective. It draws on empirical data from the cognitive and neurosciences.

Este trabajo examina si la pregunta “¿puede pensar una máquina?” ha sido respondida de manera satisfactoria. La primera sección, justamente, examina el dictum cartesiano según el cual una máquina no puede pensar en principio. La segunda trata sobre una rebelión en contra de Descartes, encabezada por Babbage. A su vez, la tercera describe una segunda rebelión encabezada por Turing. En ambas se examina, primero el lenguaje mentalista/instrumentalista para describir a una máquina programada y segundo, el reemplazo de la pregunta por (...) el Juego de la Imitación. En la cuarta sección sostengo que la evidencia aportada por dicho juego nos devuelve a la pregunta, pese a Turing. Por último, la quinta sección versa sobre cómo la Habitación China de Searle, paradójicamente, apoya el dictum cartesiano, y lo hace porque tal experimento mental se basa en una capacidad mental falible: la introspección. Se concluye que la pregunta acerca de si puede pensar una máquina es derivada de otra pregunta filosófica compleja: la de la naturaleza de lo mental y el problema mente-cuerpo. (shrink)

Can the machines that play board games or recognize images only in the comfort of the virtual world be intelligent? To become reliable and convenient assistants to humans, machines need to learn how to act and communicate in the physical reality, just like people do. The authors propose two novel ways of designing and building Artificial General Intelligence (AGI). The first one seeks to unify all participants at any instance of the Turing test – the judge, the machine, the human (...) subject as well as the means of observation instead of building a separating wall. The second one aims to design AGI programs in such a way so that they can move in various environments. The authors of the article thoroughly discuss four areas of interaction for robots with AGI and introduce a new idea of techno-umwelt bridging artificial intelligence with biology in a new way. (shrink)

This paper discusses the epistemic status of biology from the standpoint of the systemic approach to living systems based on the notion of biological autonomy. This approach aims to provide an understanding of the distinctive character of biological systems and this paper analyses its theoretical and epistemological dimensions. The paper argues that, considered from this perspective, biological systems are examples of emergent phenomena, that the biological domain exhibits special features with respect to other domains, and that biology as a discipline (...) employs some core concepts, such as teleology, function, regulation among others, that are irreducible to those employed in physics and chemistry. It addresses the claim made by Jacques Monod that biology as a science is marginal. It argues that biology is general insofar as it constitutes a paradigmatic example of complexity science, both in terms of how it defines the theoretical object of study and of the epistemology and heuristics employed. As such, biology may provide lessons that can be applied more widely to develop an epistemology of complex systems. (shrink)

This essay provides a novel account of iterated epistemic states. The essay argues that states of epistemic determinacy might be secured by countenancing iterated epistemic states on the model of fixed points in the modal $\mu$-calculus. Despite the epistemic indeterminacy witnessed by the invalidation of modal axiom 4 in the sorites paradox -- i.e. the KK principle: $\square$$\phi$ $\rightarrow$ $\square$$\square$$\phi$ -- a hyperintensional epistemic $\mu$-automaton permits fixed points to entrain a principled means by which to iterate epistemic states and account (...) thereby for necessary conditions on self-knowledge. The hyperintensional epistemic $\mu$-calculus is applied to the iteration of the epistemic states of a single agent instead of the common knowledge of a group of agents, and is thus a novel contribution to the literature. (shrink)

The core of the problem discussed in this paper is the following: the Church-Turing Thesis states that Turing Machines formally explicate the intuitive concept of computability. The description of Turing Machines requires description of the notation used for the input and for the output. Providing a general definition of notations acceptable in the process of computations causes problems. This is because a notation, or an encoding suitable for a computation, has to be computable. Yet, using the concept of computation, in (...) a definition of a notation, which will be further used in a definition of the concept of computation yields an obvious vicious circle. The circularity of this definition causes trouble in distinguishing on the theoretical level, what is an acceptable notation from what is not an acceptable notation, or as it is usually referred to in the literature, “deviant encodings”. Deviant encodings appear explicitly in discussions about what is an adequate or correct conceptual analysis of the concept of computation. In this paper, I focus on philosophical examples where the phenomenon appears implicitly, in a “disguised” version. In particular, I present its use in the analysis of the concept of natural number. I also point at additional phenomena related to deviant encodings: conceptual fixed points and apparent “computability” of uncomputable functions. In parallel, I develop the idea that Carnapian explications provide a much more adequate framework for understanding the concept of computation, than the classical philosophical analysis. (shrink)

O eixo desta investigação é a noção de linguagem inata e interna, proposta por Jerry Fodor, que teve como principal desafio a tradição analítica do século XX, a qual se fundamentou no antimentalismo de Wittgenstein e na sua negação de uma linguagem privada. A hipótese da “linguagem do pensamento” pode ser equivocadamente associada ao conceito de linguagem natural. Por isso, Fodor sugere uma distinção entre tais linguagens, visto que a do pensamento deve ser compreendida como manipulação “interna” de símbolos. Esta (...) noção de “interno” tem gerado controvérsias quando confrontada com a tradição wittgensteiniana. Neste trabalho, apresentamos os alcances e limites da hipótese fodoriana de uma linguagem do pensamento, almejando especificamente discutir o impasse quanto à noção de “interno” suscitado por tal hipótese. (shrink)

This is a non-technical version of "The Decision Problem for Effective Procedures." The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined, even if it does not have a purely mathematical definition—and even if (as many have asserted) for that reason, the Church–Turing thesis (that the effectively calculable functions on natural numbers are exactly the general recursive functions), cannot be proved. However, it is logically provable from the notion of an (...) effective procedure--without reliance on any (partially) mathematical thesis or conjecture concerning effective procedures, such as the Church–Turing thesis--that the class of effective procedures is undecidable, i.e., that no effective procedure is possible for ascertaining whether a given procedure is effective. The proof does not appeal to a precise definition of ‘effective procedure’. Instead, it relies solely and entirely on a basic grasp of the intuitive notion of such a procedure. Though this undecidability result itself is not surprising, it is also not without significance. It has the consequence, for example, that the solution to a decision problem, if it is to be complete, must be accompanied by a separate argument that the proposed ascertainment procedure is, in fact, a decision procedure, i.e., effective—for example, that it invariably terminates with the correct verdict. (shrink)

The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined even if it is not sufficiently formal and precise to belong to mathematics proper (in a narrow sense)—and even if (as many have asserted) for that reason the Church–Turing thesis is unprovable. It is proved logically that the class of effective procedures is not decidable, i.e., that no effective procedure is possible for ascertaining whether a given procedure is effective. This (...) undecidability result is proved directly from the notion itself of an effective procedure, without reliance on any (partly) mathematical lemma, conjecture, or thesis invoking recursiveness or Turing-computability. In fact, there is no reliance on anything very mathematical. The proof does not even appeal to a precise definition of ‘effective procedure’. Instead, it relies solely and entirely on a basic grasp of the intuitive notion of an effective procedure. Though the result that effectiveness is undecidable is not surprising, it is also not without significance. It has the consequence, for example, that the solution to a decision problem, if it is to be complete, must be accompanied by a separate argument that the proposed ascertainment procedure invariably terminates with the correct verdict. (shrink)

Nous proposons une étude de la constitution du sens dans l'interaction humain-machine à partir des définitions que donnent Turing et Wittgenstein à propos de la pensée, la compréhension, et de la décision. Nous voulons montrer par l'analyse comparative des proximités et différences conceptuelles entre les deux auteurs que le sens commun entre humains et machines se co-constitue dans et à partir de l'action, et que c'est précisément dans cette co-constitution que réside la valeur sociale de leur interaction. Il s'agira pour (...) cela de problématiser l'interaction humain-machine autour de la question de ce que signifie « suivre une règle » pour définir et distinguer les modes interprétatifs et les comportements décisionnels de chacun. Nous en viendrons alors au constat que la mutualisation des signes qui s'opère à travers le dialogue humain-machine est au fondement de la constitution d'une société informatisée. (shrink)

Proceedings of the papers presented at the Symposium on "Revisiting Turing and his Test: Comprehensiveness, Qualia, and the Real World" at the 2012 AISB and IACAP Symposium that was held in the Turing year 2012, 2–6 July at the University of Birmingham, UK. Ten papers. - http://www.pt-ai.org/turing-test --- Daniel Devatman Hromada: From Taxonomy of Turing Test-Consistent Scenarios Towards Attribution of Legal Status to Meta-modular Artificial Autonomous Agents - Michael Zillich: My Robot is Smarter than Your Robot: On the Need for (...) a Total Turing Test for Robots - Adam Linson, Chris Dobbyn and Robin Laney: Interactive Intelligence: Behaviour-based AI, Musical HCI and the Turing Test - Javier Insa, Jose Hernandez-Orallo, Sergio España - David Dowe and M.Victoria Hernandez-Lloreda: The anYnt Project Intelligence Test (Demo) - Jose Hernandez-Orallo, Javier Insa, David Dowe and Bill Hibbard: Turing Machines and Recursive Turing Tests — Francesco Bianchini and Domenica Bruni: What Language for Turing Test in the Age of Qualia? - Paul Schweizer: Could there be a Turing Test for Qualia? - Antonio Chella and Riccardo Manzotti: Jazz and Machine Consciousness: Towards a New Turing Test - William York and Jerry Swan: Taking Turing Seriously (But Not Literally) - Hajo Greif: Laws of Form and the Force of Function: Variations on the Turing Test. (shrink)

This is an amended version of material that first appeared in A. Clark, Microcognition: Philosophy, Cognitive Science, and Parallel Distributed Processing (MIT Press, Cambridge, MA, 1989), Ch. 1, 2, and 6. It appears in German translation in Metzinger,T (Ed) DAS LEIB-SEELE-PROBLEM IN DER ZWEITEN HELFTE DES 20 JAHRHUNDERTS (Frankfurt am Main: Suhrkamp. 1999).

Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turing-computable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally equivalent to an abstract state machine. This theorem presupposes three natural postulates about algorithmic computation. Here, we show that augmenting those postulates with an additional requirement regarding basic operations gives a natural axiomatization of computability and a proof of Church's (...) Thesis, as Gödel and others suggested may be possible. In a similar way, but with a different set of basic operations, one can prove Turing's Thesis, characterizing the effective string functions, and--in particular--the effectively-computable functions on string representations of numbers. (shrink)

The birth, growth, stabilization and subsequent understanding of a new field of practical and theoretical enquiry is always a conceptual process including several typologies of events, phenomena an...

In 1931 Kurt Gödel published his incompleteness results, and some years later Church and Turing showed that the decision problem for certain systems of symbolic logic has a negative solution. However, already in 1921 the young logician Emil Post worked on similar problems which resulted in what he called an “anticipation” of these results. For several reasons though he did not submit these results to a journal until 1941. This failure ‘to be the first’, did not discourage him: his contributions (...) to mathematical logic and its foundations should not be underestimated. It is the purpose of this article to show that an interest in the early work of Emil Post should be motivated not only by this historical fact, but also by the fact that Post’s approach and method differs substantially from those offered by Gödel, Turing and Church. In this paper it will be shown how this method evolved in his early work and how it finally led him to his results. (shrink)

ABSTRACTAlexander Wendt’s Quantum Mind and Social Science is an effort to establish foundations of social science based on the ontology of modern physics. The quantum revolution has deservedly had repercussions in many sciences, but it is unwise to ground social science on physical theories, which are subject to constant revision. Additionally, despite its empirical success, there is no agreed-upon interpretation of quantum theory. Finally, even if there were, the random indeterminacy intrinsic to the quantum world cannot account for the intentionality (...) of human action. Intentional agents act for reasons, not at random; nor are the reasons chosen at random. (shrink)

In recent years philosophers have been interested in the methodology of metaphysics. Most of these developments are related to formal work in logic or physics, often against the backdrop of the Carnap-Quine debate on ontology. Drawing on Quine’s later work, I argue that a psychological or cognitive perspective on metaphysical topics may be a valuable addition to contemporary metametaphysics. The method is illustrated by means of cognitive studies of the notions “identity,” “vagueness,” and “object” and is compared to other extant (...) metametaphysical positions. (shrink)