Despite the growing interest in female expatriates, few empirical studies have focussed on corporate career development activities available to women. Given the faltering corporate support for female business expatriates in general, one may presume that such organizational activities are less available to women than to men. To test this proposition, a large number of Western female and male business expatriates assigned to Hong Kong responded to a mail survey. Controlling for differences between the two gender groups, three significant gender differences (...) were found, all indicating a lower availability of these corporate activities to women than to men, partially supporting expectations. These corporate career development activities were fast track programs, individual career counseling and career planning workshops. Implications of these findings for globalizing firms as well as for their female employees are discussed in detail. (shrink)

'What is real?' has been one of the key questions of philosophy since its beginning in antiquity. But it is not just a question that philosophers ask. This Very Short Introduction discusses what reality is by looking at a variety of arguments, theories, and thought-experiments from philosophy, physics, and cognitive science.

The relevance of metamathematical researches for philosophy of math- ematics is an indubitable matter. In the paper I shall speak about impli- cations of metamathematics for general philosophy, especially for classical epistemological problems. Let us start with a historical observation con- cerning Hilbert's programme, the rst research programme in metamathe- matics as a separate study of formal systems. This programme was strongly in uence by epistemological considerations. In fact, Hilbert wanted to se- cure all classical mathematics against inconsistencies and this (...) aim had be achieved with the help of nitary consistency proof. Hilbert's claim is like the Cartesian project of reduction of all concepts to clarae et distinctae ideae. The epistemological commitment of original Hilbert's programme may be treated as a prelim- inary heuristic motivation for looking for epistemological implications of metamathematical results. It seems reasonable to examine in this respect three so-called limitative theorems: the rst Godel's incompleteness theo- rem , the second Godel's incom- pleteness theorem consistency of S, cannot be proved in S, providing that S is consistent) and Tarski's undenability theorem ; \S" stands for formal system containing elementary number theory. From the above-mentioned theorems we obtain an important, from philosophical point of view, conclusion: semantics of S cannot be expressed in S. Now, I shall present three applications of limitative theorems to the analysis of classical epistemological problems. (shrink)

Núñez et al.'s (2019) negative assessment of the field of cognitive science derives from evaluation criteria that fail to reflect the true nature of the field. In reality, the field is thriving on both the research and educational fronts, and it shows great promise for the future.

This book argues that (1) AI will continue to produce machines with the capacity to pass stronger and stronger versions of the Turing Test but that (2) the "Person Building Project" (the attempt by AI and Cognitive Science to build a machine which is a person) will inevitably fail. The defense of (2) rests in large part on a refutation of the proposition that persons are automata -- a refutation involving an array of issues, from free will to Godel to (...) introspection to Searle and beyond. The defense of. (shrink)

1. Die erste Hälfte des Kommentars, mit Ausnahme der Kapitel über die Weltseele.

Stephenson (2022) has argued that Kant’s thesis that all transcendental truths are transcendentally a priori knowable leads to omniscience of all transcendental truths. His arguments depend on luminosity principles and closure principles for transcendental knowability. We will argue that one pair of a luminosity and a closure principle should not be used, because the closure principle is too strong, while the other pair of a luminosity and a closure principle should not be used, because the luminosity principle is too strong. (...) Stephenson’s argument also depends on a factivity principle for transcendental knowability, which we will argue to be false. (shrink)

Alan Turing devised his famous test through a slight modificationof the parlor game in which a judge tries to ascertain the gender of twopeople who are only linguistically accessible. Stevan Harnad hasintroduced the Total TT, in which the judge can look at thecontestants in an attempt to determine which is a robot and which aperson. But what if we confront the judge with an animal, and arobot striving to pass for one, and then challenge him to peg which iswhich? Now (...) we can index TTT to a particular animal and its syntheticcorrelate. We might therefore have TTTrat, TTTcat,TTTdog, and so on. These tests, as we explain herein, are abetter barometer of artificial intelligence than Turing's originalTT, because AI seems to have ammunition sufficient only to reach thelevel of artificial animal, not artificial person. (shrink)

The Natural Philosophy of Jan Bayer The main focus of this study is a reconstruction of the natural philosophy of the early modern Prešov's scholar Jan (Johannes) Bayer (1630–1674), with special regard to its Mosaic profile. After a critical reading of the research done on Bayer up to this point, the author concludes that Bayer’s natural-philosophical work, as such, has not yet been satisfactorily analyzed, nor has its connection to its supposedly two most important sources, Francis Bacon and Jan Amos (...) Comenius, been sufficiently explored. The study therefore concentrates on a critical analysis of Bayer’s interpretation of creation and his natural history, which are then both situated in the philosophical context of their time. The author then notes that although Bayer’s project of erecting an original and on the (especially Aristotelian) tradition independent Mosaic natural philosophy ended in failure, the thinker’s work can be assessed as a valuable attempt to synthesize Baconian and Comenian motifs while at the same time reflecting broader intellectual contexts of the period. (shrink)

This article argues that existing systems on the Web cannot approach human‐level intelligence, as envisioned by Descartes, without being able to achieve genuine problem solving on unseen problems. The article argues that this entails committing to a strong intensional logic. In addition to revising extant arguments in favor of intensional systems, it presents a novel mathematical argument to show why extensional systems can never hope to capture the inherent complexity of natural language. The argument makes its case by focusing on (...) representing, with increasing degrees of complexity, knowledge in a first‐order language. Nevertheless, the attempts at representation fail to achieve consistency, making the case for an intensional representation system for natural language clear. (shrink)

The Turing Test is claimed by many to be a way to test for the presence, in computers, of such ``deep'' phenomena as thought and consciousness. Unfortunately, attempts to build computational systems able to pass TT have devolved into shallow symbol manipulation designed to, by hook or by crook, trick. The human creators of such systems know all too well that they have merely tried to fool those people who interact with their systems into believing that these systems really have (...) minds. And the problem is fundamental: the structure of the TT is such as to cultivate tricksters. A better test is one that insists on a certain restrictive epistemic relation between an artificial agent A, its output o, and the human architect H of A – a relation which, roughly speaking, obtains when H cannot account for how A produced o. We call this test the ``Lovelace Test'' in honor of Lady Lovelace, who believed that only when computers originate things should they be believed to have minds. (shrink)

We draw an analogy between Hilbert's program (HP) for mathematics and Newell's program (NP) for cognitive modeling. The analogy reveals that NP, like HP before it, is fundamentally flawed. The only alternative is a program anchored by an admission that cognition is more than computation.

The original proof of the four-color theorem by Appel and Haken sparked a controversy when Tymoczko used it to argue that the justification provided by unsurveyable proofs carried out by computers cannot be a priori. It also created a lingering impression to the effect that such proofs depend heavily for their soundness on large amounts of computation-intensive custom-built software. Contra Tymoczko, we argue that the justification provided by certain computerized mathematical proofs is not fundamentally different from that provided by surveyable (...) proofs, and can be sensibly regarded as a priori. We also show that the aforementioned impression is mistaken because it fails to distinguish between proof search (the context of discovery) and proof checking (the context of justification). By using mechanized proof assistants capable of producing certificates that can be independently checked, it is possible to carry out complex proofs without the need to trust arbitrary custom-written code. We only need to trust one fixed, small, and simple piece of software: the proof checker. This is not only possible in principle, but is in fact becoming a viable methodology for performing complicated mathematical reasoning. This is evinced by a new proof of the four-color theorem that appeared in 2005, and which was developed and checked in its entirety by a mechanical proof system. (shrink)

Is it true that if zombies---creatures who are behaviorally indistinguishable from us, but no more conscious than a rock-are logically possible, the computational conception of mind is false? Are zombies logically possible? Are they physically possible? This paper is a careful, sustained argument for affirmative answers to these three questions.

Khemlani et al. (2018) mischaracterize logic in the course of seeking to show that mental model theory (MMT) can accommodate a form of inference (, let us label it) they find in a high percentage of their subjects. We reveal their mischaracterization and, in so doing, lay a landscape for future modeling by cognitive scientists who may wonder whether human reasoning is consistent with, or perhaps even capturable by, reasoning in a logic or family thereof. Along the way, we note (...) that the properties touted by Khemlani et al. as innovative aspects of MMT‐based modeling (e.g., nonmonotonicity) have for decades been, in logic, acknowledged and rigorously specified by families of (implemented) logics. Khemlani et al. (2018) further declare that is “invalid in any modal logic.” We demonstrate this to be false by our introduction (Appendix A) of a new propositional modal logic (within a family of such logics) in which is provably valid, and by the implementation of this logic. A second appendix, B, partially answers the two‐part question, “What is a formal logic, and what is it for one to capture empirical phenomena?”. (shrink)

I critically review Raymond Turner’s Computational Artifacts – Towards a Philosophy of Computer Science by placing beside his position a rather different one, according to which computer science is a branch of, and is therefore subsumed by, immaterial formal logic.

What''s computation? The received answer is that computation is a computer at work, and a computer at work is that which can be modelled as a Turing machine at work. Unfortunately, as John Searle has recently argued, and as others have agreed, the received answer appears to imply that AI and Cog Sci are a royal waste of time. The argument here is alarmingly simple: AI and Cog Sci (of the Strong sort, anyway) are committed to the view that cognition (...) is computation (or brains are computers); butall processes are computations (orall physical things are computers); so AI and Cog Sci are positively silly.I refute this argument herein, in part by defining the locutions x is a computer and c is a computation in a way that blocks Searle''s argument but exploits the hard-to-deny link between What''s Computation? and the theory of computation. However, I also provide, at the end of this essay, an argument which, it seems to me, implies not that AI and Cog Sci are silly, but that they''re based on a form of computation that is well beneath human persons. (shrink)

The dominant scientific and philosophical view of the mind – according to which, put starkly, cognition is computation – is refuted herein, via specification and defense of the following new argument: Computation is reversible; cognition isn't; ergo, cognition isn't computation. After presenting a sustained dialectic arising from this defense, we conclude with a brief preview of the view we would put in place of the cognition-is-computation doctrine.

Fetzer famously claims that program verification is not even a theoretical possibility, and offers a certain argument for this far-reaching claim. Unfortunately for Fetzer, and like-minded thinkers, this position-argument pair, while based on a seminal insight that program verification, despite its Platonic proof-theoretic airs, is plagued by the inevitable unreliability of messy, real-world causation, is demonstrably self-refuting. As I soon show, Fetzer is like the person who claims: ‘My sole claim is that every claim expressed by an English sentence and (...) starting with the phrase “My sole claim” is false’. Or, more accurately, such thinkers are like the person who claims that modus tollens is invalid, and supports this claim by giving an argument that itself employs this rule of inference. (shrink)

It is a frequent assumption that—via superluminal information transfers—superluminal signals capable of enabling communication are necessarily exchanged in any quantum theory that posits hidden superluminal influences. However, does the presence of hidden superluminal influences automatically imply superluminal signalling and communication? The non-signalling theorem mediates the apparent conflict between quantum mechanics and the theory of special relativity. However, as a ‘no-go’ theorem there exist two opposing interpretations of the non-signalling constraint: foundational and operational. Concerning Bell’s theorem, we argue that Bell employed (...) both interpretations, and that he finally adopted the operational position which is associated often with ontological quantum theory, e.g., de Broglie–Bohm theory. This position we refer to as “effective non-signalling”. By contrast, associated with orthodox quantum mechanics is the foundational position referred to here as “axiomatic non-signalling”. In search of a decisive communication-theoretic criterion for differentiating between “axiomatic” and “effective” non-signalling, we employ the operational framework offered by Shannon’s mathematical theory of communication, whereby we distinguish between Shannon signals and non-Shannon signals. We find that an effective non-signalling theorem represents two sub-theorems: Non-transfer-control theorem, and Non-signification-control theorem. Employing NTC and NSC theorems, we report that effective, instead of axiomatic, non-signalling is entirely sufficient for prohibiting nonlocal communication. Effective non-signalling prevents the instantaneous, i.e., superluminal, transfer of message-encoded information through the controlled use—by a sender-receiver pair —of informationally-correlated detection events, e.g., in EPR-type experiments. An effective non-signalling theorem allows for nonlocal quantum information transfer yet—at the same time—effectively denies superluminal signalling and communication. (shrink)

This article argues that existing systems on the Web cannot approach human-level intelligence, as envisioned by Descartes, without being able to achieve genuine problem solving on unseen problems. The article argues that this entails committing to a strong intensional logic. In addition to revising extant arguments in favor of intensional systems, it presents a novel mathematical argument to show why extensional systems can never hope to capture the inherent complexity of natural language. The argument makes its case by focusing on (...) representing, with increasing degrees of complexity, knowledge in a first-order language. Nevertheless, the attempts at representation fail to achieve consistency, making the case for an intensional representation system for natural language clear. (shrink)

Students of Thomas Aquinas have so far lacked a comprehensive study of his doctrine of the transcendentals. This volume fills this lacuna, showing the fundamental character of the notions of being, one, true and good for his thought. The book inquires into the beginnings of the doctrine in the thirteenth century and explains the relation of the transcendental way of thought to Aquinas's conception of metaphysics. It analyzes 'Being', 'One', 'True', 'Good' and 'Beautiful' individually and discusses their importance for the (...) philosophical knowledge of God. Medieval Philosophy and the Transcendentals: The Case of Thomas Aquinas is intended as a contribution to the question 'What is philosophy in the Middle Ages?' It argues that the doctrine of the transcendentals is essential for understanding medieval philosophy. (shrink)

Is knowledge-how, or “practical” knowledge, a species of knowledge-that, or “theoretical” knowledge? There is no comfortable position to take in the debate around this question. On the one hand, there are counterexamples against the anti-intellectualist thesis that practical knowledge is best analysed as an ability. They show that having an ability to ϕ is not necessary for knowing how to ϕ. On the other hand, the intellectualist analysis of practical knowledge as a subspecies of theoretical knowledge is threatened by its (...) own set of counterexamples, which convincingly establish that practical knowledge lacks many of the typical characteristics of theoretical knowledge. Most strikingly it does not even appear to require a belief. In this paper, I develop an account of practical knowledge that avoids these counterexamples. It also manages to preserve both the status of such knowledge as a cognitive achievement and its apparently close conceptual relation to abilities. I start with the counterexamples against the necessity of abilities for practical knowledge and show that they fail because they underestimate the cognitive demands of attempts. I then make use of the logic of dispositions to bridge the gap that counterexamples against the necessity of abilities for practical knowledge open. It is argued that, instead of the ability to ϕ, it is a specific disposition to have the ability to ϕ that constitutes practical knowledge about ϕ. The resulting theory is an anti-intellectualist position that preserves essential intellectualist motivations and thus should be satisfactory for proponents of both views. (shrink)

I urge return by the lights of logic and commonsense to a dialectical tabula rasa – according to which: (1) consciousness, in the ordinary pre-analytic sense of the term, is identified with P-consciousness, and “A-consciousness” is supplanted by suitably configured terms from its Blockian definition; (2) the supposedly fallacious Searlean argument for the view that a function of P-consciousness is to allow flexible and creative cognition is enthymematic and, when charitably specified, quite formidable.

Andrew Boucher (1997) argues that ``parallel computation is fundamentally different from sequential computation'' (p. 543), and that this fact provides reason to be skeptical about whether AI can produce a genuinely intelligent machine. But parallelism, as I prove herein, is irrelevant. What Boucher has inadvertently glimpsed is one small part of a mathematical tapestry portraying the simple but undeniable fact that physical computation can be fundamentally different from ordinary, ``textbook'' computation (whether parallel or sequential). This tapestry does indeed immediately imply (...) that human cognition may be uncomputable. (shrink)