Originally published in 1905, this book presents a discussion regarding the nature of the subject-predicate relationship, or more specifically 'the Existential Import of Predication'. Textual notes are incorporated throughout. This book will be of value to anyone with an interest in logic and the development of philosophy.

Summary We have considered complete consistent systems in the first‐oder predicate calculus with identity, and have studied the set of the models of such a system by means of the maximal consistent condition‐sets associated with the system. The results may be summarized thus: (a) A complete consistent system is no‐categorical (= categorical in the denumerable domain) if and only if for every n, the number of different conditions in n variables is finite (T10). (b) If a complete consistent (...) system has a model M with finite character (i.e. a model M such that every maximal consistent condition‐set satisfied in M has a finite basis), then this model M is uniquely characterized by the property that every other model is an arithmetic extension of M (T 5). (c) Every complete consistent system, which has only a denumerable number of different associated maximal consistent condition‐sets, has a model with finite character (T8). (shrink)

The concept of “life” certainly is of some use to distinguish birds and beavers from water and stones. This pragmatic usefulness has led to its construal as a categorical predicate that can sift out living entities from non-living ones depending on their possessing specific properties—reproduction, metabolism, evolvability etc. In this paper, we argue against this binary construal of life. Using text-mining methods across over 30,000 scientific articles, we defend instead a degrees-of-life view and show how these methods can contribute (...) to experimental philosophy of science and concept explication. We apply topic-modeling algorithms to identify which specific properties are attributed to a target set of entities (bacteria, archaea, viruses, prions, plasmids, phages and the molecule of adenine). Eight major clusters of properties were identified together with their relative relevance for each target entity (two that relate to metabolism and catalysis, one to genetics, one to evolvability, one to structure, and—rather unexpectedly—three that concern interactions with the environment broadly construed). While aligning with intuitions—for instance about viruses being less alive than bacteria—these quantitative results also reveal differential degrees of performance that have so far remained elusive or overlooked. Taken together, these analyses provide a conceptual “lifeness space” that makes it possible to move away from a categorical construal of life by empirically assessing the relative lifeness of more-or-less alive entities. (shrink)

In “Properties and the Interpretation of Second-Order Logic” Bob Hale develops and defends a deflationary conception of properties where a property with particular satisfaction conditions actually exists if and only if it is possible that a predicate with those same satisfaction conditions exists. He argues further that, since our languages are finitary, there are at most countably infinitely many properties and, as a result, the account fails to underwrite the standard semantics for second-order logic. Here a more lenient version of (...) the view is explored, which allows for the possibility of countably infinite predicates understood as the product of linguistic supertasks. This enriched deflationist account of properties—the Infinitary Deflationary Conception of Existence—supports the standard semantics for models with countable first-order domains, and allows one to prove the categoricity of the second-order Peano axioms. (shrink)

Studies of the conceptual abilities of nonhuman primates demonstrate the substantial range of these abilities as well as their limitations. Such abilities range from categorization on the basis of shared physical attributes, associative relations and functions to abstract concepts as reflected in analogical reasoning about relations between relations. The pattern of results from these studies point to a fundamental distinction between monkeys and apes in both their implicit and explicit conceptual capacities. Monkeys, but not apes, might be best regarded as (...) “paleo‐logicans” in the sense that they form common class concepts of identity on the basis of identical predicates (i.e., shared features). The discrimination of presumably more abstract relations commonly involves relatively simple procedural strategies mediated by associative processes likely shared by all mammals. There is no evidence that monkeys can perceive, let alone judge, relations‐between‐relations. This analogical conceptual capacity is found only in chimpanzees and humans. Interestingly, the “analogical ape,” like the child, can make its analogical knowledge explicit only if it is first provided with a symbol system by which propositional representations can be encoded and manipulated. (shrink)

This paper focuses on the categoricity of arithmetic and determinacy of arithmetical truth. Several ‘internal’ categoricity results have been discussed in the recent literature. Against the background of the philosophical position called internalism, we propose and investigate truth-theoretic versions of internal categoricity based on a primitive truth predicate. We argue for the compatibility of a primitive truth predicate with internalism and provide a novel argument for (and proof of) a truth-theoretic version of internal categoricity and internal determinacy with some positive (...) properties. (shrink)

In this paper, we show that the predicate logics of consistent extensions of Heyting's Arithmetic plus Church's Thesis with uniqueness condition are complete $\Pi _{2}^{0}$. Similarly, we show that the predicate logic of HA*, i.e. Heyting's Arithmetic plus the Completeness Principle (for HA*) is complete $\Pi _{2}^{0}$. These results extend the known results due to Valery Plisko. To prove the results we adapt Plisko's method to use Tennenbaum's Theorem to prove 'categoricity of interpretations' under certain assumptions.

Here, we present a category ${\mathbf {pEff}}$ which can be considered a predicative variant of Hyland's Effective Topos ${{\mathbf {Eff} }}$ for the following reasons. First, its construction is carried in Feferman’s predicative theory of non-iterative fixpoints ${{\widehat {ID_1}}}$. Second, ${\mathbf {pEff}}$ is a list-arithmetic locally cartesian closed pretopos with a full subcategory ${{\mathbf {pEff}_{set}}}$ of small objects having the same categorical structure which is preserved by the embedding in ${\mathbf {pEff}}$ ; furthermore subobjects in ${{\mathbf {pEff}_{set}}}$ are classified (...) by a non-small object in ${\mathbf {pEff}}$. Third ${\mathbf {pEff}}$ happens to coincide with the exact completion of the lex category defined as a predicative rendering in ${{\widehat {ID_1}}}$ of the subcategory of ${{\mathbf {Eff} }}$ of recursive functions and it validates the Formal Church’s thesis. Hence pEff turns out to be itself a predicative rendering of a full subcategory of ${{\mathbf {Eff} }}$. (shrink)

This clearly written book makes logic interesting and easier to learn without sacrificing content or rigor. It covers symbolization, proofs, counterexamples, and truth trees. These topics are presented in graded steps, beginning with the symbolization of categorical propositions and concluding with the properties of relations. Logic is applied to materials with which readers will be familiar; both examples and exercises are drawn from newspapers, television, and other popular sources. For individuals intrigued by the formal study of logic.

Finitely algebraizable deductive systems were introduced by Blok and Pigozzi to capture the essential properties of those deductive systems that are very tightly connected to quasivarieties of universal algebras. They include the equivalential logics of Czelakowski. Based on Blok and Pigozzi’s work, Herrmann defined algebraizable deductive systems. These are the equivalential deductive systems that are also truth-equational, in the sense that the truth predicate of the class of their reduced matrix models is explicitly definable by some set of unary equations. (...) Raftery undertook the task of characterizing the property of truth-equationality for arbitrary deductive systems. In this paper, following Raftery, we extend the notion of truth-equationality for logics formalized as $\pi$-institutions and abstract several of the results that hold for deductive systems in this more general categorical context. (shrink)

Using the category of metric spaces as a template, we develop a metric analogue of the categorical semantics of classical/intuitionistic logic, and show that the natural notion of predicate in this “continuous semantics” is equivalent to the a priori separate notion of predicate in continuous logic, a logic which is independently well-studied by model theorists and which finds various applications. We show this equivalence by exhibiting the real interval $[0,1]$ in the category of metric spaces as a “continuous subobject (...) classifier” giving a correspondence not only between the two notions of predicate, but also between the natural notion of quantification in the continuous semantics and the existing notion of quantification in continuous logic.Along the way, we formulate what it means for a given category to behave like the category of metric spaces, and afterwards show that any such category supports the aforementioned continuous semantics. As an application, we show that categories of presheaves of metric spaces are examples of such, and in fact even possess continuous subobject classifiers. (shrink)

We pursue the idea that predicate logic is a “fibred algebra” while propositional logic is a single algebra; in the context of intuitionism, this algebraic understanding of predicate logic goes back to Lawvere, in particular his concept of hyperdoctrine. Here, we aim at demonstrating that the notion of monad-relativised hyperdoctrines, which are what we call fibred algebras, yields algebraisations of a wide variety of predicate logics. More specifically, we discuss a typed, first-order version of the non-commutative Full Lambek calculus, which (...) has extensively been studied in the past few decades, functioning as a unifying language for different sorts of logical systems (classical, intuitionistic, linear, fuzzy, relevant, etc.). Through the concept of Full Lambek hyperdoctrines, we establish both generic and set-theoretical completeness results for any extension of the base system; the latter arises from a dual adjunction, and is relevant to the tripos-to-topos construction and quantale-valued sets. Furthermore, we give a hyperdoctrinal account of Girard’s and Gödel’s translation. (shrink)

We claim that Kant's doctrine of the "transcendental ideal of pure reason" contains, in an anticipatory sense, a second-order theory of reality (as a second-order property) and of the highest being. Such a theory, as reconstructed in this paper, is a transformation of Kant's metatheoretical regulative and heuristic presuppositions of empirical theories into a hypothetical ontotheology. We show that this metaphysical theory, in distinction to Descartes' and Leibniz's ontotheology, in many aspects resembles Gödel's theoretical conception of the possibility of a (...) supreme being. The proposed second-order modal formalization of the Kantian doctrine of the "transcendental ideal" of the supreme being includes some specific features of Kantian general logic like "categorical", "hypothetical", and exclusive disjunctive propositions as basic forms. (shrink)

The purpose of this paper is to outline an alternative approach to introductory logic courses. Traditional logic courses usually focus on the method of natural deduction or introduce predicate calculus as a system. These approaches complicate the process of learning different techniques for dealing with categorical and hypothetical syllogisms such as alternate notations or alternate forms of analyzing syllogisms. The author's approach takes up observations made by Dijkstrata and assimilates them into a reasoning process based on modified notations. The (...) author's model adopts a notation that addresses the essentials of a problem while remaining easily manipulated to serve other analytic frameworks. The author also discusses the pedagogical benefits of incorporating the model into introductory logic classes for topics ranging from syllogisms to predicate calculus. Since this method emphasizes the development of a clear and manipulable notation, students can worry less about issues of translation, can spend more energy solving problems in the terms in which they are expressed, and are better able to think in abstract terms. (shrink)

A first-order structure $\mathfrak {A}$ is called monadically stable iff every expansion of $\mathfrak {A}$ by unary predicates is stable. In this paper we give a classification of the class $\mathcal {M}$ of $\omega $ -categorical monadically stable structure in terms of their automorphism groups. We prove in turn that $\mathcal {M}$ is the smallest class of structures which contains the one-element pure set, is closed under isomorphisms, and is closed under taking finite disjoint unions, infinite copies, and finite (...) index first-order reducts. Using our classification we show that every structure in $\mathcal {M}$ is first-order interdefinable with a finitely bounded homogeneous structure. We also prove that every structure in $\mathcal {M}$ has finitely many reducts up to interdefinability, thereby confirming Thomas’ conjecture for the class $\mathcal {M}$. (shrink)

Geach's account of the Aristotelian logic of categorical sentences supplemented the views shared by Frege, Russell, Quine and others. I argue that this particular predicate logic approach and Geach's points apply to only one variety of natural language categorical sentences. For example, it takes the universal categorical as a universal conditional “If anything is a man, then it is mortal”. A different natural language form can and should be invoked: “Every man is a mortal.” Employing special restricted (...) quantifiers in a version of predicate logic, we justify a full square of opposition and the rules of quality and quantity that Geach rejected. (shrink)

This monograph explores the logical systems of early logicians in the Arabic tradition from a theoretical perspective, providing a complete panorama of early Arabic logic and centering it within an expansive historical context. By thoroughly examining the writings of the first Arabic logicians, al-Fārābī, Avicenna and Averroes, the author analyzes their respective theories, discusses their relationship to the syllogistics of Aristotle and his followers, and measures their influence on later logical systems. Beginning with an introduction to the writings of the (...) most prominent Arabic logicians, the author scrutinizes these works to determine their categorical logic, as well as their modal and hypothetical logics. Where most other studies written on this subject focus on the Arabic logicians’ epistemology, metaphysics, and theology, this volume takes a unique approach by focusing on the actual technical aspects and features of their logics. The author then moves on to examine the original texts as closely as possible and employs the symbolism of modern propositional, predicate, and modal logics, rendering the arguments of each logician clearly and precisely while clarifying the theories themselves in order to determine the differences between the Arabic logicians’ systems and those of Aristotle. By providing a detailed examination of theories that are still not very well-known in Western countries, the author is able to assess the improvements that can be found in the Arabic writings, and to situate Arabic logic within the breadth of the history of logic. This unique study will appeal mainly to historians of logic, logicians, and philosophers who seek a better understanding of the Arabic tradition. It also will be of interest to modern logicians who wish to delve into the historical aspects and progression of their discipline. Furthermore, this book will serve as a valuable resource for graduate students who wish to complement their general knowledge of Arabic culture, logic, and sciences. (shrink)

Among the complete ℵ0-categorical theories with finite non-logical vocabularies, we distinguish three classes. The classification is obtained by looking at the number of bound variables needed to isolated complete types. In classI theories, all types are isolated by quantifier free formulas; in classII theories, there is a leastm, greater than zero, s.t. all types are isolated by formulas in no more thanm bound variables: and in classIII theories, for eachm there is a type which cannot be isolated inm or (...) fewer bound variables. ClassII theories are further subclassified according to whether or not they can be extended to classI theories by the addition of finitely many new predicates. Alternative characterizations are given in terms of quantifier elimination and homogeneous models. It is shown that for each primep, the theory of infinite Abelian groups all of whose elements are of orderp is classI when formulated in functional constants, and classIII when formulated in relational constants. (shrink)

The paper is devoted to applications of algebraic logic to databases. In databases a query is represented by a formula of first order logic. The same query can be associated with different formulas. Thus, a query is a class of equivalent formulae: equivalence here being similar to that in the transition to the Lindenbaum-Tarski algebra. An algebra of queries is identified with the corresponding algebra of logic. An algebra of replies to the queries is also associated with algebraic logic. These (...) relations lie at the core of the applications.In this paper it is shown how the theory of Halmos (polyadic) algebras (a notion introduced by Halmos as a tool in the algebraization of the first order predicate calculus) is used to create the algebraic model of a relational data base. The model allows us, in particular, to solve the problem of databases equivalence as well as develop a formal algebraic definition of a database's state description. In this paper we use the term "state description" for the logical description of the model. This description is based on the notion of filters in Halmos algebras. When speaking of a state description, we mean the description of a function which realizes the symbols of relations as real relations in the given system of data. (shrink)

This clearly written book makes logic interesting and easier to learn without sacrificing content or rigor. KEY TOPICS: It covers symbolization, proofs, counterexamples, and truth trees. These topics are presented in graded steps, beginning with the symbolization of categorical propositions and concluding with the properties of relations. Logic is applied to materials with which readers will be familiar; both examples and exercises are drawn from newspapers, television, and other popular sources. MARKET: For individuals intrigued by the formal study of (...) logic. (shrink)

This essay examines how Husserl stretches the bounds of his philosophy of meaning, according to which all propositions are categorical, to account for existential propositions, which seem to lack predicates. I examine Husserl’s counterintuitive conclusion that an existential proposition does possess a predicate and I explore his endeavor to pinpoint what that predicate is. This goal is accomplished in three stages. First, I examine Husserl’s standard theory of predication and categorial intuition from his 1901 Logical Investigations. Second, I (...) show how Husserl imposes those 1901 insights to uncover the predicate of the existential proposition in unpublished manuscripts and lectures. He determines that the existential proposition predicates of the subject, that it corresponds to an actual object. This analysis reveals that Husserl’s descriptions of existential propositions from the late 1890s employed both static and genetic methodologies. In those texts, he carefully untangles and clarifies the co-enmeshed passive and active moments of consciousness and shows that the passive givenness of certain circumstances is the condition of possibility for our active verifying of propositions. Finally, I execute a critical assessment of Husserl’s thought to reveal that, while his insights about existential propositions are largely correct, they are augmented by re-construing them within the context of his mature philosophy. Only by renouncing his metaphysical neutrality and by accounting for intersubjectivity, can Husserl properly clarify existential propositions. (shrink)

We introduce a predicative version of topos based on the notion of small maps in algebraic set theory, developed by Joyal and one of the authors. Examples of stratified pseudotoposes can be constructed in Martin-Löf type theory, which is a predicative theory. A stratified pseudotopos admits construction of the internal category of sheaves, which is again a stratified pseudotopos. We also show how to build models of Aczel-Myhill constructive set theory using this categorical structure.

The traditional square of opposition is generalized and extended to a cube of opposition covering and conveniently visualizing inter-sentential oppositions in relational syllogistic logic with the usual syllogistic logic sentences obtained as special cases. The cube comes about by considering Frege–Russell’s quantifier predicate logic with one relation comprising categorical syllogistic sentence forms. The relationships to Buridan’s octagon, to Aristotelian modal logic, and to Klein’s 4-group are discussed.GraphicThe photo shows a prototype sculpture for the cube.

What is meant under the genuine title of Aristotle’s ta Analytika is rarely properly understood. Presumably, his analytics was inspired by the method of geometric analysis. For Aristotle, this was a regressive or heuristic procedure, departing from a proposed conclusion and asking which premises could be found in order to syllogize, demonstrate or explain it. The terms that form categorical and modal propositions play a fundamental role in analytics. Aristotle introduces letters in lieu of the triples of terms constitut­ing (...) the propositions and the three syllogistic figures that schematize them. His formulation of the three syllogistic figures refers to a syntacti­cal and predicative order and position of the triples of terms, arranged in some diagrammed schemata, which, regrettably, are missing from the extant text of the Prior Analytics. Considering planar and graphic arrangements, both vertical and horizontal orders as well as the posi­tion of the three terms involved, we propose a reconstruction, at least to some extent, of these probable lettered diagrams. In such reconstructed diagrams, we can appropriately capture the definition of syllogism as a predicative connexion of terms, and easier survey a synoptic account of all valid predicative relations and transpositions, and also reduce the imperfect syllogisms into the moods of the first figure. Aristotle’s syllogistic is an analytical calculation of terms, understood as predicates and subjects within the categorical propositions, and more precisely of three terms schematized in three figures in predicative links such that, by means of a middle, follows from necessity a conclusion of the extreme terms. The necessity of the consequence is not based on the implication or inference of the propositions, but on a predictive transi­tivity through the middle term within the syllogistic figures. Syllogism must draw its conclusion through the way its terms are predicated of one another. Aristotle in his Prior Analytics developed also a complex account of modal syllogisms within necessity and possibility of belonging. This account involves also such an analyti­cal reduction to the syllogistic figures. In this analytical perspective, we try to throw some light on his modal syllogisms, although this difficult and nowadays thoroughly discussed topic would require a much wider treatment. (shrink)

Strawson aims in this work to explain the foundation of the basic combination of subject and predicate on which logic rests and to develop a more comprehensive view of subject and predicate in the light of the general notion of grammar. Goals and are addressed in parts 1 and 2, respectively. Though aim might seem to be less plausible than given the complexity and diversity of the grammars of natural languages, nevertheless, since all language-users share the same broad-based categories of (...) thought about the world, any developed language will contain elements that fall under one of these categories. Here lies the link between and. As in the foundation of the subject-predicate duality in logic is the categorical distinction between particular and universal in ontology and/or perceptual object and concept in epistemology, so in, given that same categorical duality, we should expect to find that all language-types share certain basic structural features. We should even expect to find that some ways of satisfying some of the basic requirements of essential grammar in the various language-types are more natural to us than others. (shrink)

Using the framework of categorical logic, this paper analyzes and streamlines Gabbay's semantical proof of the Craig interpolation theorem for intuitionistic predicate logic. In the process, an apparently new and interesting fact about the relation of coherent and intuitionistic logic is found.

According to the well–known argument, the traditional conception of existence and predication leads to the infamous paradox of non-existence. For instance, the sentence ‘Pegasus does not exist’ commits us to accept that there is something that does not exist. The easy way out is to analyze existence as a second–order concept expressing that there is at least one instance of some first–order concept. In this article, I argue that the traditional conception of existence and predication does not lead (...) to the paradox of non-existence. Negative existentials are not subject-predicate sentences that select existing beings only to deny them the property of existence. Aristotle’s insistence that being is not a genus, i.e. that being is not a predicate of some subject, is pivotal. Furthermore, Aristotle does not have a uniform conception of existence and predication. According to Aristotle, to be is to be an item in the categorical scheme, and consequently, every predication of some being should be analysable as one of the most general types of predication according to the categorical scheme. However, in the conceptual framework of Aristotle’s philosophy, a different problem of non-existence arises. For instance, ‘Pegasus is thought-about’ might commits us to the claim that Pegasus is a being of some kind. I reconstruct Aristotle’s solution as being satisfactory in the light of his understanding of predication and existence. Moreover, I suggest that a similar puzzle leads many contemporary philosophers to an abandonment of the Quinean concept of existence and predication in favour of a more traditional approach. (shrink)

"However that may be, Aristotelian syllogistic concerned itself exclusively with monadic predicates. Hence it could not begin to investigate multiple quantification. And that is why it never got very far. None the less, the underlying grammar of Aristotle's logic did not in itself..

In this article, we address the problem of how people understand predicative metaphors such as “The rumor flew through the office,” and argue that predicative metaphors are understood as indirect (or two-stage) categorizations. In the indirect categorization process, the verb (e.g., fly) of a predicative metaphor evokes an intermediate entity, which in turn evokes a metaphoric category of actions or states (e.g., “to spread rapidly and soon disappear”) to be attributed to the target noun (e.g., rumor), rather than directly evoking (...) a metaphoric category as argued by CitationGlucksberg's (2001) categorization theory. We test our argument using two experiments, namely, offline comprehension and online priming. The offline comprehension experiment showed that interpretation of predicative metaphors had greater overlap with words indirectly associated with the verb than those directly associated with the verb. The online priming experiment demonstrated that indirectly associated words were activated during predicative metaphor comprehension, but directly associated words were not. These results provide convergent evidence for our argument, and thus the psychological validity of two-stage categorization as a process of predicative metaphor comprehension was confirmed. (shrink)

Contemporary logicians continue to address problems associated with the existential import of categorical propositions. One notable problem concerns invalid instances of subalternation in the case of a universal proposition with an empty subject term. To remedy problems, logicians restrict first-order predicate logics to exclude such terms. Examining the historical origins of contemporary discussions reveals that logicians continue to make various category mistakes. We now believe that no proposition per se has existential import as commonly understood and thus it is (...) unnecessary to restrict first-order predicate logics to non-empty classes. After introducing the problem, we trace some nineteenth century treatments of the issue to locate a source of misconstruing propositional import in misconceptions of ‘implies’ and ‘affirms’ and name the process/product fallacy, along with the translation of categorical sentences using quantifiers and accommodating an empty class. Next we treat some metalogical matters to orient our discussion by which we provide a more precise nomenclature about ‘sentence’ and ‘proposition’ to correct previous misconceptions; here we uncover a common category mistake in respect of a proposition’s efficacy. The semantic distinction between agent and force is helpful in this connection. We conclude by showing that logicians have reinserted existence as a predicate, a position previously excised by Kant, and that the Frege-Russell ambiguity thesis applies only to relationships within a categorical sentence between grammatical predicate and subject. (shrink)

Recently, Feferman and Hellman (and Aczel) showed how to establish the existence and categoricity of a natural number system by predicative means given the primitive notion of a finite set of individuals and given also a suitable pairing function operating on individuals. This short paper shows that this existence and categoricity result does not rely (even indirectly) on finite-set induction, thereby sustaining Feferman and Hellman's point in favor of the view that natural number induction can be derived from a very (...) weak fragment of finite-set theory, so weak that finite-set induction is not assumed. Many basic features of finiteness fail to hold in these weak fragments, conspicuously the principle that finite sets are in one-one correspondence with a proper initial segments of a (any) natural number structure. In the last part of the paper, we propose two prima facie evident principles for finite sets that, when added to these fragments, entail this principle. (shrink)

According to Aristotelian logic, in categorical logic, there are three kinds of judgements (qaḍīyya): affirmative, negative, and metathetic (ma‘dūla). Khūnajī, a famous Muslim logician in the 13th century, introduces a different judgement (or statement) entitled “affirmative judgement with the negative predicate” (mūjiba al-sāliba al-maḥmūl; henceforth, ANP judgement). Although in the Arabic language, formally, ANP judgement is similar to definite negative (sāliba muḥaṣṣala) and also metathetic judgements, the way of its construction is different from both of them and its truth (...) conditions are different from metathetic ones. From a modern logic viewpoint, ANP may indicate equality judgement; however, attributing it to Muslim logicians is questionable, although some of their wordings may implicitly show it. According to Ḥāʾirī, an Iranian contemporary philosopher and logician, the new judgement is supposed to solve some problems, especially logical explanation of the division of modalities into necessity, impossibility, and contingency (imkān khāṣṣ). However, Ṭabāṭabāʾī, another Iranian contemporary philosopher, disagrees with Ḥāʾirī and regards ANP judgement the same as an affirmative metathetic one. In this paper, while examining Ṭabāṭabāʾī’s and Ḥāʾirī’s reasons, by using some insights into modern logic, I will try to strengthen Ṭabāṭabāʾī’s views, although it may be confronted with some questions or deficiencies. (shrink)

Now in paperback, Jean-Luc Marion's groundbreaking philosophy of human uncertainty. In Negative Certainties, renowned philosopher Jean-Luc Marion challenges some of the most fundamental assumptions we have developed about knowledge: that it is categorical, predicative, and positive. Following Descartes, Kant, and Heidegger, he looks toward our finitude and the limits of our reason. He asks an astonishingly simple—but profoundly provocative—question in order to open up an entirely new way of thinking about knowledge: Isn’t our uncertainty, our finitude, and rational limitations, (...) one of the few things we can be certain about? Marion shows how the assumption of knowledge as positive demands a reductive epistemology that disregards immeasurable or disorderly phenomena. He shows that we have experiences every day that have no identifiable causes or predictable reasons and that these constitute a very real knowledge—a knowledge of the limits of what can be known. Establishing this “negative certainty,” Marion applies it to four aporias, or issues of certain uncertainty: the definition of man; the nature of God; the unconditionality of the gift; and the unpredictability of events. Translated for the first time into English, Negative Certainties is an invigorating work of epistemological inquiry that will take a central place in Marion’s oeuvre. (shrink)

The article examines the relevance of Aristotle’s analysis that concerns the syllogistic figures. On the assumption that Aristotle’s analytics was inspired by the method of geometric analysis, we show how Aristotle used the three terms, when he formulated the three syllogistic figures. So far it has not been appropriately recognized that the three terms — the major, the middle and the minor one — were viewed by Aristotle syntactically and predicatively in the form of diagrams. Many scholars have misunderstood Aristotle (...) in that in the second and third figure the middle term is outside and that in the second figure the major term is next to the middle one, whereas in the third figure it is further from it. By means of diagrams, we have elucidated how this perfectly accords with Aristotle's planar and graphic arrangement. In the light of these diagrams, one can appropriately capture the definition of syllogism as a predicative set of terms. Irrespective of the tricky question concerning the abbreviations that Aristotle himself used with reference to these types of predication, the reconstructed figures allow us better to comprehend the reductions of syllogism to the first figure. We assume that the figures of syllogism are analogous to the figures of categorical predication, i.e., they are specific syntactic and semantic models. Aristotle demanded certain logical and methodological competence within analytics, which reflects his great commitment and contribution to the field. (shrink)