Search results for 'tableau method' (try it on Scholar)

1000+ found
Sort by:
  1. Diderik Batens & Joke Meheus (2001). Shortcuts and Dynamic Marking in the Tableau Method for Adaptive Logics. Studia Logica 69 (2):221-248.score: 120.0
    Adaptive logics typically pertain to reasoning procedures for which there is no positive test. In [7], we presented a tableau method for two inconsistency-adaptive logics. In the present paper, we describe these methods and present several ways to increase their efficiency. This culminates in a dynamic marking procedure that indicates which branches have to be extended first, and thus guides one towards a decision — the conclusion follows or does not follow — in a very economical way.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  2. Giambattista Amati & Fiora Pirri (1994). A Uniform Tableau Method for Intuitionistic Modal Logics I. Studia Logica 53 (1):29 - 60.score: 90.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  3. Ani Nenkova (2002). A Tableau Method for Graded Intersections of Modalities: A Case for Concept Languages. [REVIEW] Journal of Logic, Language and Information 11 (1):67-77.score: 90.0
    A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checking are formulated in terms of modal logic and an algorithm for their solution is provided. An axiomatization for a restricted graded modal language with intersection of modalities (the modal counterpart of the concept language we examine)is given and used in the proposed algorithm.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  4. Carlos Caleiro, Luca Viganò & Marco Volpe (2013). On the Mosaic Method for Many-Dimensional Modal Logics: A Case Study Combining Tense and Modal Operators. [REVIEW] Logica Universalis 7 (1):33-69.score: 90.0
    We present an extension of the mosaic method aimed at capturing many-dimensional modal logics. As a proof-of-concept, we define the method for logics arising from the combination of linear tense operators with an “orthogonal” S5-like modality. We show that the existence of a model for a given set of formulas is equivalent to the existence of a suitable set of partial models, called mosaics, and apply the technique not only in obtaining a proof of decidability and a proof (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  5. J. J. F. Nieland (1966). Beth's Tableau-Method. Synthese 16 (1):7 - 26.score: 90.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. Mitsunori Kobayashi & Arata Ishimoto (1982). A Propositional Fragment of Leśniewski's Ontology and its Formulation by the Tableau Method. Studia Logica 41 (2-3):181 - 195.score: 90.0
    The propositional fragment L 1 of Leniewski's ontology is the smallest class (of formulas) containing besides all the instances of tautology the formulas of the forms: (a, b) (a, a), (a, b) (b,). (a, c) and (a, b) (b, c). (b, a) being closed under detachment. The purpose of this paper is to furnish another more constructive proof than that given earlier by one of us for: Theorem A is provable in L 1 iff TA is a thesis of first-order (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  7. Abir Nour (2002). The Tableau Method for a Logical System Based on a Finite Poset. Journal of Applied Non-Classical Logics 12 (1):43-62.score: 90.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  8. Pierre Wolper (1985). The Tableau Method for Temporal Logic: An Overview. Logique Et Analyse 28 (110-111):119-136.score: 90.0
     
    My bibliography  
     
    Export citation  
  9. L. Farinas del Cerro (forthcoming). L. Farinas and E. ORLOWSKA, Preface 115 P. WOLPER, The Tableau Method for Temporal Logic: An Over-View 119 M. MICHEL, Computation of Temporal Operators 137. [REVIEW] Logique Et Analyse.score: 90.0
     
    My bibliography  
     
    Export citation  
  10. Susanne Bobzien (1996). Stoic Syllogistic. Oxford Studies in Ancient Philosophy 14:133-92.score: 86.0
    ABSTRACT: For the Stoics, a syllogism is a formally valid argument; the primary function of their syllogistic is to establish such formal validity. Stoic syllogistic is a system of formal logic that relies on two types of argumental rules: (i) 5 rules (the accounts of the indemonstrables) which determine whether any given argument is an indemonstrable argument, i.e. an elementary syllogism the validity of which is not in need of further demonstration; (ii) one unary and three binary argumental rules which (...)
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  11. Michael Wooldridge, Clare Dixon & Michael Fisher (1998). A Tableau-Based Proof Method for Temporal Logics of Knowledge and Belief. Journal of Applied Non-Classical Logics 8 (3):225-258.score: 78.0
    ABSTRACT In this paper we define two logics, KLn and BLn, and present tableau-based decision procedures for both. KLn is a temporal logic of knowledge. Thus, in addition to the usual connectives of linear discrete temporal logic, it contains a set of unary modal connectives for representing the knowledge possessed by agents. The logic BLn is somewhat similar; it is a temporal logic that contains connectives for representing the beliefs of agents. In addition to a complete formal definition of (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  12. Melvin Fitting (1971). A Tableau Proof Method Admitting the Empty Domain. Notre Dame Journal of Formal Logic 12 (2):219-224.score: 72.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  13. Jaakko Hintikka (2011). Method of Analysis: A Paradigm of Mathematical Reasoning? History and Philosophy of Logic 33 (1):49 - 67.score: 48.0
    The ancient Greek method of analysis has a rational reconstruction in the form of the tableau method of logical proof. This reconstruction shows that the format of analysis was largely determined by the requirement that proofs could be formulated by reference to geometrical figures. In problematic analysis, it has to be assumed not only that the theorem to be proved is true, but also that it is known. This means using epistemic logic, where instantiations of variables are (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  14. Martin Amerbauer (1996). Cut-Free Tableau Calculi for Some Propositional Normal Modal Logics. Studia Logica 57 (2-3):359 - 372.score: 48.0
    We give sound and complete tableau and sequent calculi for the prepositional normal modal logics S4.04, K4B and G 0(these logics are the smallest normal modal logics containing K and the schemata A A, A A and A ( A); A A and AA; A A and ((A A) A) A resp.) with the following properties: the calculi for S4.04 and G 0are cut-free and have the interpolation property, the calculus for K4B contains a restricted version of the cut-rule, (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  15. Arthur Buchsbaum & Tarcisio Pequeno (1993). A Reasoning Method for a Paraconsistent Logic. Studia Logica 52 (2):281 - 289.score: 42.0
    A proof method for automation of reasoning in a paraconsistent logic, the calculus C1* of da Costa, is presented. The method is analytical, using a specially designed tableau system. Actually two tableau systems were created. A first one, with a small number of rules in order to be mathematically convenient, is used to prove the soundness and the completeness of the method. The other one, which is equivalent to the former, is a system of derived (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  16. Riccardo Rosati (2001). A Sound and Complete Tableau Calculus for Reasoning About Only Knowing and Knowing at Most. Studia Logica 69 (1):171-191.score: 42.0
    We define a tableau calculus for the logic of only knowing and knowing at most ON, which is an extension of Levesque's logic of only knowing O. The method is based on the possible-world semantics of the logic ON, and can be considered as an extension of known tableau calculi for modal logic K45. From the technical viewpoint, the main features of such an extension are the explicit representation of "unreachable" worlds in the tableau, and an (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  17. Tomasz Jarmużek (2007). Construction of Tableaux for Classical Logic: Tableaux as Combinations of Branches, Branches as Chains of Sets. Logic and Logical Philosophy 16 (1):85-101.score: 42.0
    The paper is devoted to an approach to analytic tableaux for propositional logic, but can be successfully extended to other logics. The distinguishing features of the presented approach are:(i) a precise set-theoretical description of tableau method; (ii) a notion of tableau consequence relation is defined without help of a notion of tableau, in our universe of discourse the basic notion is a branch;(iii) we define a tableau as a finite set of some chosen branches which (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  18. Maarten de Rijke (2001). Handbook of Tableau Methods, Marcello D'Agostino, Dov M. Gabbay, Reiner Hähnle, and Joachim Posegga, Eds. Journal of Logic, Language and Information 10 (4):518-523.score: 36.0
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  19. Nicola Olivetti (2003). Tableaux for Łukasiewicz Infinite-Valued Logic. Studia Logica 73 (1):81 - 111.score: 30.0
    In this work we propose a labelled tableau method for ukasiewicz infinite-valued logic L . The method is based on the Kripke semantics of this logic developed by Urquhart [25] and Scott [24]. On the one hand, our method falls under the general paradigm of labelled deduction [8] and it is rather close to the tableau systems for sub-structural logics proposed in [4]. On the other hand, it provides a CoNP decision procedure for L validity (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  20. Melvin Fitting (1972). Tableau Methods of Proof for Modal Logics. Notre Dame Journal of Formal Logic 13 (2):237-247.score: 30.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  21. Michael Kohlhase, Higher-Order Automated Theorem Proving.score: 30.0
    The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification problem in typed λ-calculi is much more complex than that for first-order terms, since it has to take the theory of αβη-equality into (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  22. André Vellino (1993). The Relative Complexity of Analytic Tableaux and SL-Resolution. Studia Logica 52 (2):323 - 337.score: 30.0
    In this paper we describe an improvement of Smullyan's analytic tableau method for the propositional calculus-Improved Parent Clash Restricted (IPCR) tableau-and show that it is equivalent to SL-resolution in complexity.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  23. Kai Wehmeier (2009). On Ramsey's 'Silly Delusion' Regarding Tractatus 5.53. In Giuseppe Primiero & Shahid Rahman (eds.), Acts of Knowledge - History, Philosophy and Logic. College Publications.score: 24.0
    We investigate a variant of the variable convention proposed at Tractatus 5.53ff for the purpose of eliminating the identity sign from logical notation. The variant in question is what Hintikka has called the strongly exclusive interpretation of the variables, and turns out to be what Ramsey initially (and erroneously) took to be Wittgenstein's intended method. We provide a tableau calculus for this identity-free logic, together with soundness and completeness proofs, as well as a proof of mutual interpretability with (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  24. Andrzej Indrzejczak (2003). A Labelled Natural Deduction System for Linear Temporal Logic. Studia Logica 75 (3):345 - 376.score: 24.0
    The paper is devoted to the concise description of some Natural Deduction System (ND for short) for Linear Temporal Logic. The system's distinctive feature is that it is labelled and analytical. Labels convey necessary semantic information connected with the rules for temporal functors while the analytical character of the rules lets the system work as a decision procedure. It makes it more similar to Labelled Tableau Systems than to standard Natural Deduction. In fact, our solution of linearity representation is (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  25. Rajeev Gore, Cut-Free Single-Pass Tableaux for the Logic of Common Knowledge.score: 24.0
    We present a cut-free tableau calculus with histories and variables for the EXPTIME-complete multi-modal logic of common knowledge (LCK). Our calculus constructs the tableau using only one pass, so proof-search for testing theoremhood of ϕ does not exhibit the worst-case EXPTIME-behaviour for all ϕ as in two-pass methods. Our calculus also does not contain a “finitized ω-rule” so that it detects cyclic branches as soon as they arise rather than by worst-case exponential branching with respect to the size (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  26. Brian Rogers & Kaif Wehmeier (2012). Tractarian First-Order Logic: Identity and the N-Operator. Review of Symbolic Logic 5 (4):538-573.score: 24.0
    In the Tractatus, Wittgenstein advocates two major notational innovations in logic. First, identity is to be expressed by identity of the sign only, not by a sign for identity. Secondly, only one logical operator, called by Wittgenstein, should be employed in the construction of compound formulas. We show that, despite claims to the contrary in the literature, both of these proposals can be realized, severally and jointly, in expressively complete systems of first-order logic. Building on early work of Hintikkas, for (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  27. Marcello D'Agostino (1992). Are Tableaux an Improvement on Truth-Tables? Journal of Logic, Language and Information 1 (3):235-252.score: 24.0
    We show that Smullyan's analytic tableaux cannot p-simulate the truth-tables. We identify the cause of this computational breakdown and relate it to an underlying semantic difficulty which is common to the whole tradition originating in Gentzen's sequent calculus, namely the dissonance between cut-free proofs and the Principle of Bivalence. Finally we discuss some ways in which this principle can be built into a tableau-like method without affecting its analytic nature.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  28. Jean-Luc Amalric (2014). D'une convergence remarquable entre phénoménologie et philosophie analytique: la lecture ricœurienne des thèses de Sartre et Ryle sur l'imagination. Études Ricoeuriennes / Ricoeur Studies 5 (1):82-94.score: 24.0
    The aim of this article is to analyse the meaning and the implications of the comparative interpretation of Sartre’s and Ryle’s theses on imagination that Ricœur undertook in the still unpublished text of his Lectures on Imagination. These lectures were delivered at the University of Chicago in 1975. First, the article shows how Ricœur brings out a strong convergence , both in the method and in the presuppositions , of the Sartrean and Rylean conceptions of imagination : the choice (...)
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  29. Tomás Barrero & Walter Carnielli (2005). Tableaux sin refutación. Matemáticas: Enseñanza Universitaria 13 (2):81-99.score: 24.0
    Motivated by H. Curry’s well-known objection and by a proposal of L. Henkin, this article introduces the positive tableaux, a form of tableau calculus without refutation based upon the idea of implicational triviality. The completeness of the method is proven, which establishes a new decision procedure for the (classical) positive propositional logic. We also introduce the concept of paratriviality in order to contribute to the question of paradoxes and limitations imposed by the behavior of classical implication.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  30. Manfred Kerber Michael Kohlhase, A Tableau Calculus for Partial Functions.score: 22.0
    Even though it is not very often admitted, partial functions do play a significant role in many practical applications of deduction systems. Kleene has already given a semantic account of partial functions using a three-valued logic decades ago, but there has not been a satisfactory mechanization. Recent years have seen a thorough investigation of the framework of many-valued truth-functional logics. However, strong Kleene logic, where quantification is restricted and therefore not truthfunctional, does not fit the framework directly. We solve this (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  31. Savas Konur (2011). An Event-Based Fragment of First-Order Logic Over Intervals. Journal of Logic, Language and Information 20 (1):49-68.score: 20.0
    We consider a new fragment of first-order logic with two variables. This logic is defined over interval structures. It constitutes unary predicates, a binary predicate and a function symbol. Considering such a fragment of first-order logic is motivated by defining a general framework for event-based interval temporal logics. In this paper, we present a sound, complete and terminating decision procedure for this logic. We show that the logic is decidable, and provide a NEXPTIME complexity bound for satisfiability. This result shows (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  32. Jaakko Hintikka (2011). What is the Axiomatic Method? Synthese 183 (1):69-85.score: 18.0
    The modern notion of the axiomatic method developed as a part of the conceptualization of mathematics starting in the nineteenth century. The basic idea of the method is the capture of a class of structures as the models of an axiomatic system. The mathematical study of such classes of structures is not exhausted by the derivation of theorems from the axioms but includes normally the metatheory of the axiom system. This conception of axiomatization satisfies the crucial requirement that (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  33. Moti Mizrahi (2014). Does the Method of Cases Rest on a Mistake? Review of Philosophy and Psychology 5 (2):183-197.score: 18.0
    In this paper, I argue that the method of cases (namely, the method of using intuitive judgments elicited by intuition pumps as evidence for and/or against philosophical theories) is not a reliable method of generating evidence for and/or against philosophical theories. In other words, the method of cases is unlikely to generate accurate judgments more often than not. This is so because, if perception and intuition are analogous in epistemically relevant respects, then using intuition pumps to (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  34. Melissa McBay Merritt (2006). Science and the Synthetic Method of the Critique of Pure Reason. Review of Metaphysics 59 (3):517-539.score: 18.0
    Kant maintains that his Critique of Pure Reason follows a “synthetic method” which he distinguishes from the analytic method of the Prolegomena by saying that the Critique “rests on no other science” and “takes nothing as given except reason itself”. The paper presents an account of the synthetic method of the Critique, showing how it is related to Kant’s conception of the Critique as the “science of an a priori judging reason”. Moreover, the author suggests, understanding its (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  35. Claire Petitmengin (2006). Describing One's Subjective Experience in the Second Person: An Interview Method for the Science of Consciousness. [REVIEW] Phenomenology and the Cognitive Sciences 5 (3-4):229-269.score: 18.0
    This article presents an interview method which enables us to bring a person, who may not even have been trained, to become aware of his or her subjective experience, and describe it with great precision. It is focused on the difficulties of becoming aware of one’s subjective experience and describing it, and on the processes used by this interview technique to overcome each of these difficulties. The article ends with a discussion of the criteria governing the validity of the (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  36. Nikolay Milkov (2012). Wittgenstein’s Method: The Third Phase of Its Development (1933–36). In Marques Antonio (ed.), Knowledge, Language and Mind: Wittgenstein’s Early Investigations. de Gruyter.score: 18.0
    Wittgenstein’s interpreters are undivided that the method plays a central role in his philosophy. This would be no surprise if we have in mind the Tractarian dictum: “philosophy is not a body of doctrine but an activity” (4.112). After 1929, Wittgenstein’s method evolved further. In its final form, articulated in Philosophical Investigations, it was formulated as different kinds of therapies of specific philosophical problems that torment our life (§§ 133, 255, 593). In this paper we follow the changes (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  37. Simon Beck (2010). Morals, Metaphysics and the Method of Cases. South African Journal of Philosophy 29 (4):332-342.score: 18.0
    In this paper I discuss a set of problems concerning the method of cases as it is used in applied ethics and in the metaphysical debate about personal identity. These problems stem from research in social psychology concerning our access to the data with which the method operates. I argue that the issues facing ethics are more worrying than those facing metaphysics.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  38. John T. Sanders, Dynamical Systems and Scientific Method.score: 18.0
    Progress in the last few decades in what is widely known as “Chaos Theory” has plainly advanced understanding in the several sciences it has been applied to. But the manner in which such progress has been achieved raises important questions about scientific method and, indeed, about the very objectives and character of science. In this presentation, I hope to engage my audience in a discussion of several of these important new topics.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  39. Kenneth J. Sufka & Derek D. Turner (2005). An Evolutionary Account of Chronic Pain: Integrating the Natural Method in Evolutionary Psychology. Philosophical Psychology 18 (2):243-257.score: 18.0
    This paper offers an evolutionary account of chronic pain. Chronic pain is a maladaptive by-product of pain mechanisms and neural plasticity, both of which are highly adaptive. This account shows how evolutionary psychology can be integrated with Flanagan's natural method, and in a way that avoids the usual charges of panglossian adaptationism and an uncritical commitment to a modular picture of the mind. Evolutionary psychology is most promising when it adopts a bottom-up research strategy that focuses on basic affective (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  40. James Scott Johnston (2002). John Dewey and the Role of Scientific Method in Aesthetic Experience. Studies in Philosophy and Education 21 (1):1-15.score: 18.0
    In this paper I examine a controversy ongoingwithin current Deweyan philosophy of educationscholarship regarding the proper role and scopeof science in Dewey's concept of inquiry. Theside I take is nuanced. It is one that issensitive to the importance that Dewey attachesto science as the best method of solvingproblems, while also sensitive to thosestatements in Dewey that counter a wholesalereductivism of inquiry to scientific method. Iutilize Dewey's statements regarding the placeaccorded to inquiry in aesthetic experiences ascharacteristic of his (...), as bestconceived. (shrink)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  41. Sami Pihlström & Arto Siitonen (2005). The Transcendental Method and (Post-)Empiricist Philosophy of Science. Journal for General Philosophy of Science 36 (1):81 - 106.score: 18.0
    This paper reconsiders the relation between Kantian transcendental reflection (including transcendental idealism) and 20th century philosophy of science. As has been pointed out by Michael Friedman and others, the notion of a "relativized a priori" played a central role in Rudolf Carnap's, Hans Reichenbach's and other logical empiricists' thought. Thus, even though the logical empiricists dispensed with Kantian synthetic a priori judgments, they did maintain a crucial Kantian doctrine, viz., a distinction between the (transcendental) level of establishing norms for empirical (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  42. Dale Jacquette (2011). Enhancing the Diagramming Method in Informal Logic. ARGUMENT 1 (2):327-360.score: 18.0
    The argument diagramming method developed by Monroe C. Beardsley in his (1950) book Practical Logic, which has since become the gold standard for diagramming arguments in informal logic, makes it possible to map the relation between premises and conclusions of a chain of reasoning in relatively complex ways. The method has since been adapted and developed in a number of directions by many contemporary informal logicians and argumentation theorists. It has proved useful in practical applications and especially pedagogically (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  43. Ann Garry (1995). A Minimally Decent Philosophical Method: Analytic Philosophy and Feminism. Hypatia 10 (3):7-30. [REVIEW] Hypatia 10 (3):7-30.score: 18.0
    This essay focuses on the extent to which the methods of analytic philosophy can be useful to feminist philosophers. I pose nine general questions feminist philosophers might ask to determine the suitability of a philosophical method. Examples include: Do its typical ways of formulating problems or issues encourage the inclusion of a wide variety of women's points of view? Are its central concepts gender-biased, not merely in their origin, but in very deep, continuing ways? Does it facilitate uncovering roles (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  44. Theresa W. Tobin & Alison M. Jaggar (2013). Naturalizing Moral Justification: Rethinking the Method of Moral Epistemology. Metaphilosophy 44 (4):409-439.score: 18.0
    The companion piece to this article, “Situating Moral Justification,” challenges the idea that moral epistemology's mission is to establish a single, all-purpose reasoning strategy for moral justification because no reasoning practice can be expected to deliver authoritative moral conclusions in all social contexts. The present article argues that rethinking the mission of moral epistemology requires rethinking its method as well. Philosophers cannot learn which reasoning practices are suitable to use in particular contexts exclusively by exploring logical relations among concepts. (...)
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  45. Xianglong Zhang (2006). Flowing Within the Text: A Discussion on He Lin's Explanation of Zhu XI's Method of Intuition. Frontiers of Philosophy in China 1 (1):60-65.score: 18.0
    The author examines He Lin's interpretation of Zhu Xi's method of intuition from a phenomenological-hermeneutical perspective and by exposing Zhu's philosophical presuppositions. In contrast with Lu Xiangshan's intuitive method, Zhu Xi's method of reading classics advocates "emptying your heart and flowing with the text" and, in this spirit, explains the celebrated "exhaustive investigation on the principles of things (ge wu qiong li)." "Text," according to Zhu, is therefore not an object in ordinary sense but a "contextual region" (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  46. Sara T. Scharf (2009). Identification Keys, the "Natural Method," and the Development of Plant Identification Manuals. Journal of the History of Biology 42 (1):73 - 117.score: 18.0
    The origins of field guides and other plant identification manuals have been poorly understood until now because little attention has been paid to 18th century botanical identification guides. Identification manuals came to have the format we continue to use today when botanical instructors in post-Revolutionary France combined identification keys (step-wise analyses focusing on distinctions between plants) with the "natural method" (clustering of similar plants, allowing for identification by gestalt) and alphabetical indexes. Botanical works featuring multiple but linked techniques to (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  47. Havi Hannah Carel (2013). Illness, Phenomenology, and Philosophical Method. Theoretical Medicine and Bioethics 34 (4):345-357.score: 18.0
    In this article, I propose that illness is philosophically revealing and can be used to explore human experience. I suggest that illness is a limit case of embodied experience. By pushing embodied experience to its limit, illness sheds light on normal experience, revealing its ordinary and thus overlooked structure. Illness produces a distancing effect, which allows us to observe normal human behavior and cognition via their pathological counterpart. I suggest that these characteristics warrant illness a philosophical role that has not (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  48. Nicholas Rescher (2013). Kant's Neoplatonism: Kant and Plato on Mathematical and Philosophical Method. Metaphilosophy 44 (1-2):69-78.score: 18.0
    Both Plato and Kant devote much attention and care to deliberating about their method of philosophizing. And, interestingly, both seek to expand and explain their view of philosophical method by one selfsame strategy: explaining the contrast between rational procedure in mathematics and in philosophy. Plato and Kant agree on a fundamental point of philosophical method that is at odds with the mathematico-demonstrative methodology of philosophy found in Spinoza and present in Christian Wolff. Both reject the axiomatic approach (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  49. Mark Kaminski & Gert Smolka (2009). Terminating Tableau Systems for Hybrid Logic with Difference and Converse. Journal of Logic, Language and Information 18 (4):437-464.score: 18.0
    This paper contributes to the principled construction of tableau-based decision procedures for hybrid logic with global, difference, and converse modalities. We also consider reflexive and transitive relations. For converse-free formulas we present a terminating control that does not rely on the usual chain-based blocking scheme. Our tableau systems are based on a new model existence theorem.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  50. Cheng-Shi Liu (2011). Trial Equation Method Based on Symmetry and Applications to Nonlinear Equations Arising in Mathematical Physics. Foundations of Physics 41 (5):793-804.score: 18.0
    To find exact traveling wave solutions to nonlinear evolution equations, we propose a method combining symmetry properties with trial polynomial solution to nonlinear ordinary differential equations. By the method, we obtain some exact traveling wave solutions to the Burgers-KdV equations and a kind of reaction-diffusion equations with high order nonlinear terms. As a result, we prove that the Burgers-KdV equation does not have the real solution in the form a 0+a 1tan ξ+a 2tan 2 ξ, which indicates that (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000