Logic and Philosophy of Logic, Misc

The material interpretation of conditionals is commonly recognized as involving some paradoxical results. I here argue that the truth functional approach to natural language is the reason for the inadequacy of this material interpretation, since the truth or falsity of some pair of statements ‘p’ and ‘q’ cannot per se be decisive for the truth or falsity of a conditional relation ‘if p then q’. This inadequacy also affects the ability of the overall formal system to establish whether or not (...) arguments involving conditionals are valid. I also demonstrate that the Paradox of Indicative Conditionals does not actually involve a paradox, but instead contains some paralogistic elements that make it appear to be a paradox. The discussion of the paradox in this paper further reveals that the material interpretation of conditionals adversely affects the treatment of disjunctions. -/- Much has been said about these matters in the literature that point in the same direction. However, there seems to be some reluctance against fully complying with the arguments against the truth functional account of conditionals, since many of the alternative accounts rely on the material conditional, or at least on an understanding of the conditional as a function of antecedent and consequent in a similar sense as the material conditional. My argument against truth functionality indicates that it may in general involve similar problems to treat conditionals as such functions, whether one deals with theories of truth, assertability or probability. (shrink)

Grice argues that indicative conditionals ‘if p then q’ have conventional, truth conditional meaning according to the material conditional ‘p  q’. In order to explain away the known paradoxes with this interpretation, he distinguishes between truth conditions and assertion conditions, attempting to demonstrate that the assumed connection between ‘p’ and ‘q’ (the Indirectness Condition) is a conversational implicature; hence a matter only relevant for the assertion conditions of a conditional. This paper argues that Grice fails to demonstrate i) that (...) the Indirectness Condition is cancellable, hence a conversational implicature, ii) that the Indirectness Condition is not part of the conventional, truth-relevant meaning of ‘if’, and accordingly, iii) semantic or logical equivalence between indicative and material conditionals. (shrink)

The conditional interpretation of general categorical statements like ‘All men are animals’ as universally quantified material conditionals ‘For all x, if x is F, then x is G’ suggests that the logical structure of law statements is conditional rather than categorical. Disregarding the problem that the universally quantified material conditional is trivially true whenever there are no xs that are F, there are some reasons to be sceptical of Frege’s equivalence between categorical and conditional expressions. -/- Now many philosophers will (...) claim that the material conditional interpretation of laws statements, dispositions ascriptions, or any causal claim is generally accepted as wrong and outdated. Still, there seem to be some basic logical assumptions that are shared by most of the participants in the debate on causal matters which at least stems from the traditional truth functional interpretation of conditionals. This is indicated by the vocabulary in the philosophical debate on causation, where one often speaks of ‘counterfactuals’, ‘possible worlds’ and ‘necessity’ without being explicit on whether or to what extent one accepts the logical-technical definition of these notions. To guarantee a non-Humean and non-extensional approach to causal relations, it is therefore important to be aware of the logical and metaphysical implications of the technical vocabulary. -/- In this paper we want to show why extensional logic cannot deal with causal relations. Via a logical analysis of law-like statements ‘All Fs are Gs’ we hope to throw some new light on interrelated notions like causation, laws, induction, hypotheticality and modality. If successful, our analysis should be of relevance for a deeper understanding of any type of causal relations, whether we understand them to be laws, dispositions, singulars or categoricals. (shrink)

According to Satosi Watanabe's "theorem of the ugly duckling", the number of predicates satisfied by any two different particulars is a constant, which does not depend on the choice of the two particulars. If the number of predicates satisfied by two particulars is their number of properties in common, and the degree of resemblance between two particulars is a function of their number of properties in common, then it follows that the degree of resemblance between any two different particulars is (...) a constant, which does not depend on the choice of the two particulars either. Avoiding this absurd conclusion requires questioning assumptions involving infinity in the proof or interpretation of the theorem, adopting a sparse conception of properties according to which not every predicate corresponds to a property, or denying that degree of resemblance is a function of number of properties in common. After arguing against the first two options, this paper argues for a version of the third which analyses degrees of resemblance in terms of degrees of naturalness of common properties. In the course of doing so, it presents a novel account of natural properties. (shrink)

Homo deceptus is a book that brings together new ideas on language, consciousness and physics into a comprehensive theory that unifies science and philosophy in a different kind of Theory of Everything. The subject of how we are to make sense of the world is addressed in a structured and ordered manner, which starts with a recognition that scientific truths are constructed within a linguistic framework. The author argues that an epistemic foundation of natural language must be understood before laying (...) claim to any notion of reality. This foundation begins with Ludwig Wittgenstein’s Tractatus Logico-Philosophicus and the relationship of language to formal logic. Ultimately, we arrive at an answer to the question of why people believe the things they do. This is effectively a modification of Alfred Tarski’s semantic theory of truth. The second major issue addressed is the ‘dreaded’ Hard Problem of Consciousness as first stated by David Chalmers in 1995. The solution is found in the unification of consciousness, information theory and notions of physicalism. The physical world is shown to be an isomorphic representation of the phenomenological conscious experience. New concepts in understanding how language operates help to explain why this relationship has been so difficult to appreciate. The inclusion of concepts from information theory shows how a digital mechanics resolves heretofore conflicting theories in physics, cognitive science and linguistics. Scientific orthodoxy is supported, but viewed in a different light. Mainstream science is not challenged, but findings are interpreted in a manner that unifies consciousness without contradiction. Digital mechanics and formal systems of logic play central roles in combining language, consciousness and the physical world into a unified theory where all can be understood within a single consistent framework. (shrink)

We present a philosophical motivation for the logics of formal inconsistency, a family of paraconsistent logics whose distinctive feature is that of having resources for expressing the notion of consistency within the object language. We shall defend the view according to which logics of formal inconsistency are theories of logical consequence of normative and epistemic character. This approach not only allows us to make inferences in the presence of contradictions, but offers a philosophically acceptable account of paraconsistency.

The notion of strength has featured prominently in recent debates about abductivism in the epistemology of logic. Following Williamson and Russell, we distinguish between logical and scientific strength and discuss the limits of the characterizations they employ. We then suggest understanding logical strength in terms of interpretability strength and scientific strength as a special case of logical strength. We present applications of the resulting notions to comparisons between logics in the traditional sense and mathematical theories.

By extending the notion of a Well Formed Formula to include syntactically formalized rules for rejecting semantically incorrect expressions we recognize and reject expressions that have the semantic error of Pathological self-reference(Olcott 2004). The foundation of this system requires the notion of a BaseFact that anchors the semantic notions of True and False. When-so-ever a formal proof from BaseFacts of language L to a closed WFF X or ~X of language L does not exist X is decided to be semantically (...) incorrect. (shrink)

Ontological arguments like those of Gödel (1995) and Pruss (2009; 2012) rely on premises that initially seem plausible, but on closer scrutiny are not. The premises have modal import that is required for the arguments but is not immediately grasped on inspection, and which ultimately undermines the simpler logical intuitions that make the premises seem plausible. Furthermore, the notion of necessity that they involve goes unspecified, and yet must go beyond standard varieties of logical necessity. This leaves us little reason (...) to believe the premises, while their implausible existential import gives us good reason not to. (shrink)

In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics and a set of logical constants (with specified arities). The first generator returns formulae of exactly the given depth, using all or some of the propositional letters. The second does the same but samples up-to the given depth. The third generator outputs formulae with exactly (...) the desired depth and all the atomics in the set. To make the generators uniform (i.e. to make them return every formula in their space with the same probability), we will prove various cardinality results about those spaces. (shrink)

Artificial Intelligence, in press. Abstract: For some time we have been developing, and have had significant practical success with, a time-sensitive, contradiction-tolerant logical reasoning engine called the active logic machine (ALMA). The current paper details a semantics for a general version of the underlying logical formalism, active logic. Central to active logic are special rules controlling the inheritance of beliefs in general (and of beliefs about the current time in particular), very tight controls on what can be derived from direct (...) contradictions (P &￢P), and mechanisms allowing an agent to represent and reason about its own beliefs and past reasoning. Furthermore, inspired by the notion that until an agent notices that a set of beliefs is contradictory, that set seems consistent (and the agent therefore reasons with it as if it were consistent), we introduce an “apperception function” that represents an agent’s limited awareness of its own beliefs, and serves to modify inconsistent belief sets so as to yield consistent sets. Using these ideas, we introduce a new definition of logical consequence in the context of active logic, as well as a new definition of soundness such that, when reasoning with consistent premises, all classically sound rules remain sound in our new sense. However, not everything that is classically sound remains sound in our sense, for by classical definitions, all rules with contradictory premises are vacuously sound, whereas in active logic not everything follows from a contradiction. (shrink)

Informal rigour is the process by which we come to understand particular mathematical structures and then manifest this rigour through axiomatisations. Structural relativity is the idea that the kinds of structures we isolate are dependent upon the logic we employ. We bring together these ideas by considering the level of informal rigour exhibited by our set-theoretic discourse, and argue that different foundational programmes should countenance different underlying logics (intermediate between first- and second-order) for formulating set theory. By bringing considerations of (...) perturbations in modal space to bear on the debate, we will suggest that a promising option for representing current set-theoretic thought is given by formulating set theory using quasi-weak second-order logic. These observations indicate that the usual division of structures into \particular (e.g. the natural number structure) and general (e.g. the group structure) is perhaps too coarse grained; we should also make a distinction between intentionally and unintentionally general structures. (shrink)

Often philosophers, logicians, and mathematicians employ a notion of intended structure when talking about a branch of mathematics. In addition, we know that there are foundational mathematical theories that can find representatives for the objects of informal mathematics. In this paper, we examine how faithfully foundational theories can represent intended structures, and show that this question is closely linked to the decidability of the theory of the intended structure. We argue that this sheds light on the trade-off between expressive power (...) and meta-theoretic properties when comparing first-order and second-order logic. (shrink)

Since Peirce defined the first operators for three-valued logic, it is usually assumed that he rejected the principle of bivalence. However, I argue that, because bivalence is a principle, the stra...

In this article I offer an explicating interpretation of the procedure of content recarving as described by Frege in §64 of the Foundations of Arithmetic. I argue that the procedure of content recarving may be interpreted as an operation that while restricting the subject matter of a sentence, performs a generalization on what the sentence says about its subject matter. The characterization of the recarving operation is given in the setting of Yablo’s theory of subject matter and it is based (...) on the relation of determination between properties. The main advantage of the proposal is its generality, for it is applicable not just to the case of abstraction principles. (shrink)

In this article, we discuss a simple argument that modal metaphysics is misconceived, and responses to it. Unlike Quine’s, this argument begins with the banal observation that there are different candidate interpretations of the predicate ‘could have been the case’. This is analogous to the observation that there are different candidate interpretations of the predicate ‘is a member of’. The argument then infers that the search for metaphysical necessities is misguided in much the way the ‘set-theoretic pluralist’ (Clarke-Doane & Hamkins (...) [2017]) claims that the search for the true axioms of set theory is. We show that the obvious responses to this argument fail. However, a new response has emerged that purports to prove, from higher order logical principles, that metaphysical possibility is the broadest kind of possibility applying to propositions, and is to that extent special. We distill two lines of reasoning from the literature, and argue that their import depends on premises that a ‘modal pluralist’ should deny. Both presuppose that there is a unique typed hierarchy, which is what the modal pluralist, in the context of higher-order logic, should disavow. In other words, both presupposes that there is a unique candidate for what higher-order claims could mean. We consider the worry that, in a higher-order setting, modal pluralism faces an insuperable problem of articulation, collapses into modal monism, is vulnerable to the Russell-Myhill paradox, or even contravenes the truism that there is a unique actual world, and argue that these worries are misplaced. We also sketch the bearing of the resulting ‘Higher Order Pluralism’ on the theory of content. One upshot is that, if Higher Order Pluralism is true, then there is no fixed metatheory from which to characterize higher order reality. (shrink)

Much of the last fifty years of scholarship on Aristotle’s syllogistic suggests a conceptual framework under which the syllogistic is a logic, a system of inferential reasoning, only if it is not a theory or formal ontology, a system concerned with general features of the world. In this paper, I will argue that this a misleading interpretative framework. The syllogistic is something sui generis: by our lights, it is neither clearly a logic, nor clearly a theory, but rather exhibits certain (...) characteristic marks of logics and certain characteristic marks of theories. In what follows, I will present a debate between a theoretical and a logical interpretation of the syllogistic. The debate centers on the interpretation of syllogisms as either implications or inferences. But the significance of this question has been taken to concern the nature and subject-matter of the syllogistic, and how it ought to be represented by modern techniques. For one might think that, if syllogisms are implications, propositions with conditional form, then the syllogistic, in so far as it is a systematic taxonomy of syllogisms, is a theory or a body of knowledge concerned with general features of the world. Furthermore, if the syllogistic is a theory, then it ought to be represented by an axiomatic system, a system deriving propositional theorems from axioms. On the other hand, if syllogisms are inferences, then the syllogistic is a logic, a system of inferential reasoning. And furthermore, it ought to be represented as a natural deduction system, a system deriving valid arguments by means of intuitively valid inferences. I will argue that one can disentangle these questions—are syllogisms inferences or implications, is the syllogistic a logic or a theory, is the syllogistic a body of worldly knowledge or a system of inferential reasoning, and ought we to represent the syllogistic as a natural deduction system or an axiomatic system—and that we must if we are to have a historically accurate understanding of Aristotle. (shrink)

Prior’s puzzle is standardly taken to be the puzzle of why, given the assumption that that-clauses denote propositions, substitution of “the proposition that P” for “that P” within the complements of many propositional attitude verbs is invalid. I show that Prior’s puzzle is much more general than is ordinarily supposed. There are two variants on the substitutional form of the puzzle—a quantificational variant and a pronominal variant—and all three forms of the puzzle arise in a wide range of grammatical positions, (...) rather than merely in the complements of propositional attitude verbs. The generalized puzzle shows that a range of proposed solutions to the original puzzle fail, or are radically incomplete, and also reveals the connections between Prior’s puzzle and debates over the nature of semantic types and higher-order quantification. I go on to develop a novel, higher-order solution to the generalized form of the puzzle, and I argue that this higher-approach is superior to its first-order alternatives. (shrink)

For Kant, the human cognitive faculty has two sub-faculties: sensibility and the understanding. Each has pure forms which are necessary to us as humans: space and time for sensibility; the categories for the understanding. But Kant is careful to leave open the possibility of there being creatures like us, with both sensibility and understanding, who nevertheless have different pure forms of sensibility. They would be finite rational beings and discursive cognizers. But they would not be human. And this raises a (...) question about the pure forms of the understanding. Does Kant leave open the possibility of discursive cognizers who have different categories? Even if other discursive cognizers might not sense like us, must they at least think like us? We argue that textual and systematic considerations do not determine the answers to these questions and examine whether Kant thinks that the issue cannot be decided. Consideration of his wider views on the nature and limits of our knowledge of mind shows that Kant could indeed remain neutral on the issue but that the exact form his neutrality can take is subject to unexpected constraints. The result would be an important difference between what Kant says about discursive cognizers with other forms of sensibility and what he is in a position to say about discursive cognizers with other forms of understanding. Kantian humility here takes on a distinctive character. (shrink)

ABSTRACTThis paper seeks to clarify Husserl’s critical remarks about Kant’s view of logic by comparing their respective views of logic. In his Formal and Transcendental Logic Husserl c...

In his Formal Logic, Arthur N. Prior declared that Jan Łukasiewicz's logical notation is ‘unquestionably the best logical symbolism for most purposes’. Whether he had a substantive, and...

In debates concerning the consequence argument, it has long been claimed that McKay and Johnson (1996) demonstrated the invalidity of rule (β). Here, I argue that their result is not as robust as we might like to think. First, I argue that McKay and Johnson’s counterexample is successful if one adopts a certain interpretation of “no choice about” and if one is willing to deny the conditional excluded middle principle. In order to make this point I demonstrate that (β) is (...) valid on Stalnaker’s theory of counterfactuals. This result is important and should not be neglected, I argue, because there is a particular line of objection to the revised formulations of the consequence argument that does not succeed against the original version. (shrink)

This is to appear in a Festschrift for Hilary Putnam on his 85th birthday. This is a pre-publication, not final, version.

Although there is a prima facie strong case for a close connection between the meaning and inferential role of certain expressions, this connection seems seriously threatened by the semantic and logical paradoxes which rely on these inferential roles. Some philosophers have drawn radical conclusions from the paradoxes for the theory of meaning in general, and for which sentences in our language are true. I criticize these overreactions, and instead propose to distinguish two conceptions of inferential role. This distinction is closely (...) tied to two conceptions of deductive logic, and it is the key, I argue, for understanding first the connection between meaning and inferential role, and second what the paradoxes show more generally. (shrink)

There has been a recent interest in hierarchical generalizations of classic incompleteness results. This paper provides evidence that such generalizations are readily obtainable from suitably formulated hierarchical versions of the principles used in the original proofs. By collecting such principles, we prove hierarchical versions of Mostowski’s theorem on independent formulae, Kripke’s theorem on flexible formulae, Woodin’s theorem on the universal algorithm, and a few related results. As a corollary, we obtain the expected result that the formula expressing “ $\mathrm {T}$ (...) is $\Sigma _n$ -ill” is a canonical example of a $\Sigma _{n+1}$ formula that is $\Pi _{n+1}$ -conservative over $\mathrm {T}$. (shrink)

In this survey paper we collect several known results on destroying tall ideals on countable sets and maximal almost disjoint families with forcing. In most cases we provide streamlined proofs of the presented results. The paper contains results of many authors as well as a preview of results of a forthcoming paper of Brendle, Guzmán, Hrušák, and Raghavan.

I offer new criticisms of invariantist views of logicality, objecting especially to Gila Sher’s arguments for invariantism’s ability to explain the formality, necessity, apriority and normative force of logic. I argue that the semantic conception of logic can do perfectly well without a model-theoretic notion of logicality, and that the descriptive and explanatory theoretical roles sometimes ascribed to invariantism can be played by a non-model-theoretic account of logicality, specifically by one in which some pragmatic properties of expressions play an important (...) role. I also develop the pragmatic account beyond the mere hints offered in its defense in my earlier work. (shrink)

The unwinding that Cook, 767–774 2004) proposed is a simple but powerful method of generating new paradoxes from known ones. This paper extends Cook’s unwinding to a larger class of paradoxes and studies further the basic properties of the unwinding. The unwinding we study is a procedure, by which when inputting a Boolean modal net together with a definable digraph, we get a set of sentences in which we have a ‘counterpart’ for each sentence of the Boolean modal net and (...) each point of the digraph. What is more, whenever a sentence of the Boolean modal net says another sentence is necessary, then the counterpart of the first sentence at a point correspondingly says the counterparts of the second one at all accessible points of that point are all true. The output of the procedure is called ‘the unwinding of a Boolean modal net on a definable digraph’. We prove that the unwinding procedure preserves paradoxicality: a Boolean modal net is paradoxical on a definable digraph, iff the unwinding of it on this digraph is also paradoxical. Besides, the dependence digraph for the unwinding of a Boolean modal net on a definable digraph is proved to be isomorphic to the unwinding of the dependence digraph for the Boolean modal net on the previous definable digraph. So the unwinding of a Boolean modal net on a digraph is self-referential, iff the Boolean modal net is self-referential and the digraph is cyclic. Thus, on the one hand, the unwinding of any Boolean modal net on an acyclic digraph is non-self-referential. In particular, the unwinding of any Boolean modal net on \ is non-self-referential. On the other hand, if a Boolean modal net is paradoxical on a locally finite digraph, the unwinding of it on that digraph must be self-referential. Hence, starting from a Boolean modal paradox, the unwinding can output a non-self-referential paradox only if the digraph is not locally finite. (shrink)

We argue that, under the usual assumptions for sufficiently strong arithmetical theories that are subject to Gödel’s First Incompleteness Theorem, one cannot, without impropriety, talk about *the* Gödel sentence of the theory. The reason is that, without violating the requirements of Gödel’s theorem, there could be a true sentence and a false one each of which is provably equivalent to its own unprovability in the theory if the theory is unsound.

Purity has been recognized as an ideal of proof. In this paper, I consider whether purity continues to have value in contemporary mathematics. The topics (e.g., algebraic topology, algebraic geometry, category theory) and methods of contemporary mathematics often favor unification and generality, values that are more often associated with impurity rather than purity. I will demonstrate this by discussing several examples of methods and proofs that highlight the epistemic significance of unification and generality. First, I discuss the examples of algebraic (...) invariants and of considering a mathematical object from several different perspectives to illustrate that the methods used in contemporary mathematics favor impurity. Then I consider an example from category theory which demonstrates how unification and generality are related to impurity and that impure solutions can be explanatory. In light of this discussion, we see that purity only has marginal value within contemporary mathematics which instead prioritizes the epistemic values associated with impurity. (shrink)

The volume assembles a remarkable topical diversity of papers collected on the occasion of the 80th anniversary of Professor Jan Woleński’s, an eminent Polish analytic philo...

Motivated by weaknesses with traditional accounts of logical epistemology, considerable attention has been paid recently to the view, known as anti-exceptionalism about logic, that the subject matter and epistemology of logic may not be so different from that of the recognised sciences. One of the most prevalent claims made by advocates of AEL is that theory choice within logic is significantly similar to that within the sciences. This connection with scientific methodology highlights a considerable challenge for the anti-exceptionalist, as two (...) uncontentious claims about scientific theories are that they attempt to explain a target phenomenon and prove their worth through successful predictions. Thus, if this methodological AEL is to be viable, the anti-exceptionalist will need a reasonable account of what phenomena logics are attempting to explain, how they can explain, and in what sense they can be said to issue predictions. This paper makes sense of the anti-exceptionalist proposal with a new account of logical theory choice, logical predictivism, according to which logics are engaged in both a process of prediction and explanation. (shrink)

Descent and Logic in Biosystematics is a short multidisciplinary book about biological systematics and taxonomy. Some of the subjects covered in it are philosophical---taxonomic theory, species concepts, speciation models, and evolutionary theories. Yet the book also covers matters not philosophical, such as taxonomic operations, experimental taxonomy, and two new suggested taxonomic methods, with worked examples. The author finds relationships among these topics. The book is addressed to both working taxonomists, and to philosophers with an interest in biology. It will also (...) interest others who draw on biological taxonomy and biosystematics in their work.The book goes into some old topics such as traditional biological identifying, classifying, and nomenclature; some recent, such as evolutionary classifying based on cladistic analysis, phylogenetics, and phylogenomics; and a few new, such as the logic of mutually exclusive taxon definitions, and techniques for using directly observed reproductive events and pedigree analysis to untangle certain taxonomic dilemmas. There is a chapter about avoidable ambiguities when defining biological taxa, a chapter on the relevance of human biology to biosystematics, chapters addressing some biosystematic problems associated with the phenomenon of hybridization, and a chapter on the relationship of biological taxonomy to conservation biology. Descent and Logic in Biosystematics is published as an ebook, with twelve black and white line figures, two tables, a dynamic table of contents, linked cross references, and linked bibliographic citations. It should be considered for academic libraries, research libraries, natural history museum libraries, the libraries of conservation organizations, and some private libraries. Electronic copies may be downloaded, presently at no cost, from the publisher. (shrink)

The anti-exceptionalist debate brought into play the problem of what are the relevant data for logical theories and how such data affects the validities accepted by a logical theory. In the present paper, I depart from Laudan's reticulated model of science to analyze one aspect of this problem, namely of the role of logical data within the process of revision of logical theories. For this, I argue that the ubiquitous nature of logical data is responsible for the proliferation of several (...) distinct methodologies for logical theories. The resulting picture is coherent with the Laudanean view that agreement and disagreement between scientific theories take place at different levels. From this perspective, one is able to articulate other kinds of divergence that considers not only the inferential aspects of a given logical theory, but also the epistemic aims and the methodological choices that drive its development. (shrink)

Must probabilities be countably additive? On the one hand, arguably, requiring countable additivity is too restrictive. As de Finetti pointed out, there are situations in which it is reasonable to use merely finitely additive probabilities. On the other hand, countable additivity is fruitful. It can be used to prove deep mathematical theorems that do not follow from finite additivity alone. One of the most philosophically important examples of such a result is the Bayesian convergence to the truth theorem, which says (...) that conditional probabilities converge to 1 for true hypotheses and to 0 for false hypotheses. In view of the long-standing debate about countable additivity, it is natural to ask in what circumstances finitely additive theories deliver the same results as the countably additive theory. This paper addresses that question and initiates a systematic study of convergence to the truth in a finitely additive setting. There is also some discussion of how the formal results can be applied to ongoing debates in epistemology and the philosophy of science. (shrink)

In computational complexity theory, decision problems are divided into complexity classes based on the amount of computational resources it takes for algorithms to solve them. In theoretical computer science, it is commonly accepted that only functions for solving problems in the complexity class P, solvable by a deterministic Turing machine in polynomial time, are considered to be tractable. In cognitive science and philosophy, this tractability result has been used to argue that only functions in P can feasibly work as computational (...) models of human cognitive capacities. One interesting area of computational complexity theory is descriptive complexity, which connects the expressive strength of systems of logic with the computational complexity classes. In descriptive complexity theory, it is established that only first-order systems are connected to P, or one of its subclasses. Consequently, second-order systems of logic are considered to be computationally intractable, and may therefore seem to be unfit to model human cognitive capacities. This would be problematic when we think of the role of logic as the foundations of mathematics. In order to express many important mathematical concepts and systematically prove theorems involving them, we need to have a system of logic stronger than classical first-order logic. But if such a system is considered to be intractable, it means that the logical foundation of mathematics can be prohibitively complex for human cognition. In this paper I will argue, however, that this problem is the result of an unjustified direct use of computational complexity classes in cognitive modelling. Placing my account in the recent literature on the topic, I argue that the problem can be solved by considering computational complexity for humanly relevant problem solving algorithms and input sizes. (shrink)

How many correct logics are there? Monists endorse that there is one, pluralists argue for many, and nihilists claim that there are none. Reasoning about these views requires a logic. That is the meta-logic. It turns out that there are some meta-logical challenges specifically for the pluralists. I will argue that these depend on an implicitly assumed absoluteness of correct logic. Pluralists can solve the challenges by giving up on this absoluteness and instead adopt contextualism about correct logic. This contextualism (...) is naturalistically appealing. (shrink)

One of the most often explored, repeatedly interpreted, and recognized again and again as a valuable achievement of Kant’s philosophy, is his transcendental philosophy, a new methodological approach that – as Kant believed – will allow philosophy (metaphysics) to enter upon a secure path of science. In this paper, I explore Nicolai Hartmann’s reinterpretation and development of this methodology in both the historical and systematic context of his thought. First, I will deal with the Neo-Kantian’s understanding of the transcendental method (...) as a starting point of Hartmann’s own understanding of it. Then I will analyze in detail his only paper devoted entirely to the problem of the method, (Hartmann, 1912), to present how he understands the necessary development of this methodology. I will claim that despite the fact that Hartmann – following Kant – never denied that the real essence of philosophy is the transcendental method, he tried to show that this methodus philosophandi cannot be reduced to the Neo-Kantian’s understanding of it. He argued that the core of all true philosophical and scientific research is the transcendental method, but only insofar as it is accompanied by two other methods that are needed to complete it: descriptive and dialectical method. I will close by presenting the relations between these three methods. (shrink)

The idea that logic is in some sense normative for thought and reasoning is a familiar one. Some of the most prominent figures in the history of philosophy including Kant and Frege have been among its defenders. The most natural way of spelling out this idea is to formulate wide-scope deductive requirements on belief which rule out certain states as irrational. But what can account for the truth of such deductive requirements of rationality? By far, the most prominent responses draw (...) in one way or another on the idea that belief aims at the truth. In this paper, I consider two ways of making this line of thought more precise and I argue that they both fail. In particular, I examine a recent attempt by Epistemic Utility Theory to give a veritist account of deductive coherence requirements. I argue that despite its proponents’ best efforts, Epistemic Utility Theory cannot vindicate such requirements. (shrink)