Results for 'hypothetical reasoning, first-order predicate-logic, searching all solution, inconsistent process, subsumption process'

1000+ found
Order:
  1.  17
    述語論理知識を扱う全解探索仮説推論の高速化.林 貴宏 越野 亮 - 2001 - Transactions of the Japanese Society for Artificial Intelligence 16:202-211.
    A hypothetical reasoning, which can find an explanation for a given set of observation by assuming some hypothetical sets, is a useful knowledge processing framework because of its theoretical basis and usefulness for practical problems such as diagnostics, scheduling, and design. It is, however, known to be computationally very expensive for large problems because it must deal with incomplete knowledge. Predicate-logic allows powerful and compact knowledge representation compared to propositional-logic. Efficient methods to proceed reasoning have been developed (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  18
    仮説推論に対する3種の近似解法.岡峰 正 越野 亮 - 2001 - Transactions of the Japanese Society for Artificial Intelligence 16:465-472.
    Cost-based abduction, which is a technique for identifying the best explanation for a given observation based on the assumption of a set of hypothesis, is a useful knowledge processing framework for practical problems such as diagnosis, design and planning. However, the speed of reasoning of this approach is often slow. To overcome this problem, Kato et al. previously presented a more efficient cost-based abduction system, that utilized the A * search technique, however, the time and space complexities in this technique (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3.  39
    On the way to a Wider model theory: Completeness theorems for first-order logics of formal inconsistency.Walter Carnielli, Marcelo E. Coniglio, Rodrigo Podiacki & Tarcísio Rodrigues - 2014 - Review of Symbolic Logic 7 (3):548-578.
    This paper investigates the question of characterizing first-order LFIs (logics of formal inconsistency) by means of two-valued semantics. LFIs are powerful paraconsistent logics that encode classical logic and permit a finer distinction between contradictions and inconsistencies, with a deep involvement in philosophical and foundational questions. Although focused on just one particular case, namely, the quantified logic QmbC, the method proposed here is completely general for this kind of logics, and can be easily extended to a large family of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  4.  13
    Towards Abductive Reasoning in First-order Logic.A. Reyes-Cabello, Atocha Aliseda-Llera & Ángel Nepomuceno-fernández - 2006 - Logic Journal of the IGPL 14 (2):287-394.
    Abductive problems have been widely studied in propositional logic. First order abduction, however, has been viewed as intractable, for the undecidability of logical consequence. In this paper, we propose a notion of abductive problem, N-abductive problem, which is relative to the cardinality of the minimal model satisfying the given theory. We use a notion of restricted satisfaction, also relative to a domain cardinality. Finally, we propose an effective procedure for the searching of abductive solutions, by means of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  5. Elimination of Cuts in First-order Finite-valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - Journal of Information Processing and Cybernetics EIK 29 (6):333-355.
    A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established. As an application, an analog of Herbrand’s theorem for the four-valued knowledge-representation logic of Belnap and Ginsberg is presented. It is indicated how this theorem can be used for reasoning about knowledge bases with incomplete and inconsistent information.
    Direct download  
     
    Export citation  
     
    Bookmark   18 citations  
  6.  77
    Breve storia dell'etica.Sergio Cremaschi - 2012 - Roma RM, Italia: Carocci.
    The book reconstructs the history of Western ethics. The approach chosen focuses the endless dialectic of moral codes, or different kinds of ethos, moral doctrines that are preached in order to bring about a reform of existing ethos, and ethical theories that have taken shape in the context of controversies about the ethos and moral doctrines as means of justifying or reforming moral doctrines. Such dialectic is what is meant here by the phrase ‘moral traditions’, taken as a name (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  7. First-order swap structures semantics for some Logics of Formal Inconsistency.Marcelo E. Coniglio, Aldo Figallo-Orellano & Ana Claudia Golzio - 2020 - Journal of Logic and Computation 30 (6):1257-1290.
    The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  8. First-Order Modal Logic with an 'Actually' Operator.Yannis Stephanou - 2005 - Notre Dame Journal of Formal Logic 46 (4):381-405.
    In this paper the language of first-order modal logic is enriched with an operator @ ('actually') such that, in any model, the evaluation of a formula @A at a possible world depends on the evaluation of A at the actual world. The models have world-variable domains. All the logics that are discussed extend the classical predicate calculus, with or without identity, and conform to the philosophical principle known as serious actualism. The basic logic relies on the system (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  9.  11
    The suppression task and firstorder predicate calculus.Miguel López-Astorga - 2023 - Theoria 89 (6):800-810.
    The suppression task challenges classical logic. Classical logic is monotonic. However, in the suppression task, an inference with the form of modus ponendo ponens is inhibited by adding a new premise. Several explanations have been given to account for this fact. The present paper indicates three of them as examples: that of the theory of mental models, that based on logic programming and closed world assumption, and that referring to Carnap's concept of state‐descriptions. Besides, the paper offers one more explanation (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  26
    Proof Theory of First Order Abduction: Sequent Calculus and Structural Rules.Seyed Ahmad Mirsanei - 2021 - Eighth Annual Conference of Iranian Association for Logic (Ial).
    The logical formalism of abductive reasoning is still an open discussion and various theories have been presented about it. Abduction is a type of non-monotonic and defeasible reasonings, and the logic containing such a reasoning is one of the types of non-nonmonotonic and defeasible logics, such as inductive logic. Abduction is a kind of natural reasoning and it is a solution to the problems having this form "the phenomenon of φ cannot be explained by the theory of Θ" and we (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  11.  20
    Game Semantics, Quantifiers and Logical Omniscience.Bruno Ramos Mendonça - forthcoming - Logic and Logical Philosophy:1-22.
    Logical omniscience states that the knowledge set of ordinary rational agents is closed for its logical consequences. Although epistemic logicians in general judge this principle unrealistic, there is no consensus on how it should be restrained. The challenge is conceptual: we must find adequate criteria for separating obvious logical consequences from non-obvious ones. Non-classical game-theoretic semantics has been employed in this discussion with relative success. On the one hand, with urn semantics [15], an expressive fragment of classical game semantics that (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  57
    Decidable fragments of first-order temporal logics.Ian Hodkinson, Frank Wolter & Michael Zakharyaschev - 2000 - Annals of Pure and Applied Logic 106 (1-3):85-134.
    In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first-order logic. This reduction is then used to single out a number of decidable fragments of first- (...) temporal logics and of two-sorted first-order logics in which one sort is intended for temporal reasoning. Besides standard first-order time structures, we consider also those that have only finite first-order domains, and extend the results mentioned above to temporal logics of finite domains. We prove decidability in three different ways: using decidability of monadic second-order logic over the intended flows of time, by an explicit analysis of structures with natural numbers time, and by a composition method that builds a model from pieces in finitely many steps. (shrink)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  13.  27
    Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter.Mikhail Rybakov & Dmitry Shkatov - 2018 - Studia Logica 107 (4):695-717.
    We prove that the positive fragment of first-order intuitionistic logic in the language with two individual variables and a single monadic predicate letter, without functional symbols, constants, and equality, is undecidable. This holds true regardless of whether we consider semantics with expanding or constant domains. We then generalise this result to intervals \ and \, where QKC is the logic of the weak law of the excluded middle and QBL and QFL are first-order counterparts of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  14.  65
    Geometrisation of First-Order Logic.Roy Dyckhoff & Sara Negri - 2015 - Bulletin of Symbolic Logic 21 (2):123-163.
    That every first-order theory has a coherent conservative extension is regarded by some as obvious, even trivial, and by others as not at all obvious, but instead remarkable and valuable; the result is in any case neither sufficiently well-known nor easily found in the literature. Various approaches to the result are presented and discussed in detail, including one inspired by a problem in the proof theory of intermediate logics that led us to the proof of the present paper. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  15.  49
    Reasoning about actions and obligations in first-order logic.Gert -Jan C. Lokhorst - 1996 - Studia Logica 57 (1):221 - 237.
    We describe a new way in which theories about the deontic status of actions can be represented in terms of the standard two-sorted first-order extensional predicate calculus. Some of the resulting formal theories are easy to implement in Prolog; one prototype implementation—R. M. Lee's deontic expert shell DX—is briefly described.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  16.  39
    Reasoning about Actions and Obligations in First-Order Logic.Gert-Jan C. Lokhorst - 1996 - Studia Logica 57 (1):221 - 237.
    We describe a new way in which theories about the deontic status of actions can be represented in terms of the standard two-sorted extensional predicate calculus. Some of the resulting formal theories are easy to implement in Prolog; one prototype implementation--R. M. Lee's deontic expert shell DX--is briefly described.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  17. Classical Logic.Kazem Sadegh-Zadeh - 2015 - In Handbook of Analytic Philosophy of Medicine. Dordrecht, Heidelberg, New York, London: Springer.
    Western (deductive) logic originated in Greek antiquity. It found its first expression in those works of the great philosopher Aristotle (384–322 BC) which have come to be known as the Organon, i.e., ‘instrument’. Aristotle’s logic, also known as syllogistics, was unsystematically concerned with patterns of reasoning and argumentation. It remained in this rudimentary state relatively unchanged and unchallenged until the second half of the nineteenth century. At that time, logic underwent a period of unprecedented reform and modernization, due in (...)
     
    Export citation  
     
    Bookmark  
  18.  37
    A Temporal Logic for Reasoning about Processes and Plans.Drew McDermott - 1982 - Cognitive Science 6 (2):101-155.
    Much previous work in artificial intelligence has neglected representing time in all its complexity. In particular, it has neglected continuous change and the indeterminacy of the future. To rectify this, I have developed a firstorder temporal logic, in which it is possible to name and prove things about facts, events, plans, and world histories. In particular, the logic provides analyses of causality, continuous change in quantities, the persistence of facts (the frame problem), and the relationship between tasks and (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   81 citations  
  19.  24
    Immanent Reasoning or Equality in Action A Dialogical Study.Shahid Rahman, Nicolas Clerbout, Ansten Klev, Zoe Conaughey & Juan Redmond - unknown
    PREFACEProf. Göran Sundholm of Leiden University inspired the group of Logic at Lille and Valparaíso to start a fundamental review of the dialogical conception of logic by linking it to constructive type logic. One of Sundholm's insights was that inference can be seen as involving an implicit interlocutor. This led to several investigations aimed at exploring the consequences of joining winning strategies to the proof-theoretical conception of meaning. The leading idea is, roughly, that while introduction rules lay down the conditions (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  20.  23
    Probabilistic Entailment on First Order Languages and Reasoning with Inconsistencies.R. A. D. Soroush Rafiee - 2023 - Review of Symbolic Logic 16 (2):351-368.
    We investigate an approach for drawing logical inference from inconsistent premisses. The main idea in this approach is that the inconsistencies in the premisses should be interpreted as uncertainty of the information. We propose a mechanism, based on Kinght’s [14] study of inconsistency, for revising an inconsistent set of premisses to a minimally uncertain, probabilistically consistent one. We will then generalise the probabilistic entailment relation introduced in [15] for propositional languages to the first order case to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21.  92
    First order predicate logic with generalized quantifiers.Per Lindström - 1966 - Theoria 32 (3):186--195.
  22. Modeling the concept of truth using the largest intrinsic fixed point of the strong Kleene three valued semantics (in Croatian language).Boris Culina - 2004 - Dissertation, University of Zagreb
    The thesis deals with the concept of truth and the paradoxes of truth. Philosophical theories usually consider the concept of truth from a wider perspective. They are concerned with questions such as - Is there any connection between the truth and the world? And, if there is - What is the nature of the connection? Contrary to these theories, this analysis is of a logical nature. It deals with the internal semantic structure of language, the mutual semantic connection of sentences, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  23. Logics of Formal Inconsistency Enriched with Replacement: An Algebraic and Modal Account.Walter Carnielli, Marcelo E. Coniglio & David Fuenmayor - 2022 - Review of Symbolic Logic 15 (3):771-806.
    One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  71
    Systems of illative combinatory logic complete for first-order propositional and predicate calculus.Henk Barendregt, Martin Bunder & Wil Dekkers - 1993 - Journal of Symbolic Logic 58 (3):769-788.
    Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators or, in a more direct way, in which derivations are not translated. (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  25. The processing of negations in conditional reasoning: A meta-analytic case study in mental model and/or mental logic theory.Walter J. Schroyens, Walter Schaeken & G. - 2001 - Thinking and Reasoning 7 (2):121 – 172.
    We present a meta-analytic review on the processing of negations in conditional reasoning about affirmation problems (Modus Ponens: "MP", Affirmation of the Consequent "AC") and denial problems (Denial of the Antecedent "DA", and Modus Tollens "MT"). Findings correct previous generalisations about the phenomena. First, the effects of negation in the part of the conditional about which an inference is made, are not constrained to denial problems. These inferential-negation effects are also observed on AC. Second, there generally are reliable effects (...)
     
    Export citation  
     
    Bookmark   3 citations  
  26. First-Order Logic with Adverbs.Tristan Grøtvedt Haze - forthcoming - Logic and Logical Philosophy:1-36.
    This paper introduces two languages and associated logics designed to afford perspicuous representations of a range of natural language arguments involving adverbs and the like: first-order logic with basic adverbs (FOL-BA) and first-order logic with scoped adverbs (FOL-SA). The guiding logical idea is that an adverb can come between a term and the rest of the statement it is a part of, resulting in a logically stronger statement. I explain various interesting challenges that arise in the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27.  47
    P. C. Gilmore. A program for the production from axioms, of proofs for theorems derivable within the first order predicate calculus. English, with English, French, German, Russian, and Spanish summaries. Information processing, Proceedings of the International Conference on Information Processing, Unesco, Paris 15–20 June 1959, Unesco, Paris, R. Oldenbourg, Munich, Butterworths, London, 1960, pp. 265–273. - J. Porte, P. C. Gilmore, Dag H. Prawitz, Håkon Prawitz, and Neri Voghera. Discussion. Information processing, Proceedings of the International Conference on Information Processing, Unesco, Paris 15–20 June 1959, Unesco, Paris, R. Oldenbourg, Munich, Butterworths, London, 1960, p. 273. - P. C. Gilmore. A proof method for quantification theory: Its justification and realization. IBM journal of research and development, vol. 4 , pp. 28–35. [REVIEW]J. A. Robinson - 1996 - Journal of Symbolic Logic 31 (1):124-125.
  28.  82
    The processing of negations in conditional reasoning: A meta-analytic case study in mental model and/or mental logic theory.Walter J. Schroyens, Walter Schaeken & Géry D'Ydewalle - 2001 - Thinking and Reasoning 7 (2):121-172.
    We present a meta-analytic review on the processing of negations in conditional reasoning about affirmation problems (Modus Ponens: “MP”, Affirmation of the Consequent “AC”) and denial problems (Denial of the Antecedent “DA”, and Modus Tollens “MT”). Findings correct previous generalisations about the phenomena. First, the effects of negation in the part of the conditional about which an inference is made, are not constrained to denial problems. These inferential-negation effects are also observed on AC. Second, there generally are reliable effects (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  29.  54
    Embedding first order predicate logic in fragments of intuitionistic logic.M. H. Löb - 1976 - Journal of Symbolic Logic 41 (4):705-718.
  30.  17
    Semantical Completeness of First-Order Predicate Logic and the Weak Fan Theorem.Victor N. Krivtsov - 2015 - Studia Logica 103 (3):623-638.
    Within a weak system \ of intuitionistic analysis one may prove, using the Weak Fan Theorem as an additional axiom, a completeness theorem for intuitionistic first-order predicate logic relative to validity in generalized Beth models as well as a completeness theorem for classical first-order predicate logic relative to validity in intuitionistic structures. Conversely, each of these theorems implies over \ the Weak Fan Theorem.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  31. Dynamic predicate logic.Jeroen Groenendijk & Martin Stokhof - 1991 - Linguistics and Philosophy 14 (1):39-100.
    This paper is devoted to the formulation and investigation of a dynamic semantic interpretation of the language of first-order predicate logic. The resulting system, which will be referred to as ‘dynamic predicate logic’, is intended as a first step towards a compositional, non-representational theory of discourse semantics. In the last decade, various theories of discourse semantics have emerged within the paradigm of model-theoretic semantics. A common feature of these theories is a tendency to do away (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   357 citations  
  32.  16
    Story (first order predicate) logic.Göran Rossholm - 2007 - Semiotica 2007 (165):149-172.
    This article is an attempt to clarify the idea that narratives cohere by representing stories. Stories are causally related in the way proposed by Noël Carroll, i.e., the events and states constitute necessary conditions or sufficient conditions or INUS-conditions of each other. Then, a general concept of propositional coherence is suggested. It is based on Nelson Goodman's and Joseph Ullian's ideas about unitary formulas. Narrative coherence is defined as the propositional understanding of a text (in the wide sense, including non-verbal (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  33.  22
    Story (first order predicate) logic.Göran Rossholm - 2007 - Semiotica 2007 (165):149-172.
    This article is an attempt to clarify the idea that narratives cohere by representing stories. Stories are causally related in the way proposed by Noël Carroll, i.e., the events and states constitute necessary conditions or sufficient conditions or INUS-conditions of each other. Then, a general concept of propositional coherence is suggested. It is based on Nelson Goodman's and Joseph Ullian's ideas about unitary formulas. Narrative coherence is defined as the propositional understanding of a text (in the wide sense, including non-verbal (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  34. Peirce, logic diagrams, and the elementary operations of reasoning.P. N. Johnson-Laird - 2002 - Thinking and Reasoning 8 (1):69 – 95.
    This paper describes Peirce's systems of logic diagrams, focusing on the so-called ''existential'' graphs, which are equivalent to the first-order predicate calculus. It analyses their implications for the nature of mental representations, particularly mental models with which they have many characteristics in common. The graphs are intended to be iconic, i.e., to have a structure analogous to the structure of what they represent. They have emergent logical consequences and a single graph can capture all the different ways (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  35. Fuzzy Logic and Higher-Order Vagueness.Nicholas J. J. Smith - 2011 - In Petr Cintula, Chris Fermüller, Lluis Godo & Petr Hájek (eds.), Logical Models of Reasoning with Vague Information. pp. 1--19.
    The major reason given in the philosophical literature for dissatisfaction with theories of vagueness based on fuzzy logic is that such theories give rise to a problem of higherorder vagueness or artificial precision. In this paper I first outline the problem and survey suggested solutions: fuzzy epistemicism; measuring truth on an ordinal scale; logic as modelling; fuzzy metalanguages; blurry sets; and fuzzy plurivaluationism. I then argue that in order to decide upon a solution, we need to understand the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  36. Towards Process Ontology: A Critical Study in Substance-Ontological Premises.Johanna Seibt - 1990 - Dissertation, University of Pittsburgh
    This thesis promotes a therapeutic revision of fundamental assumptions in contemporary ontological thought. I show that none of the extant standard theories of objects provides a viable account of the numerical, qualitative, and trans-temporal identity of objects, and that this is due to certain substance-ontological premises. I argue that in order to state the identity conditions of objects we must abandon these premises, together with the idea that objects enjoy ontological primacy. ;I follow a methodological program of formally criticizing (...)
     
    Export citation  
     
    Bookmark   11 citations  
  37.  13
    Periodicity Based Decidable Classes in a First Order Timed Logic.Danièle Beauquier & Anatol Slissenko - 2006 - Annals of Pure and Applied Logic 139 (1):43-73.
    We describe a decidable class of formulas in a first order timed logic that covers a good amount of properties of real-time distributed systems. Earlier we described a decidable class based on some finiteness properties, and sketched a decidable class in a weaker logic that captures periodicity properties, though without complete proof. The new feature of the decidable class presented here is to be able to treat parametric properties, in particular, properties that concern an arbitrary number of processes (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  38.  11
    Intrinsic reasoning about functional programs I: first order theories.Daniel Leivant - 2002 - Annals of Pure and Applied Logic 114 (1-3):117-153.
    We propose a rudimentary formal framework for reasoning about recursion equations over inductively generated data. Our formalism admits all equational programs , and yet singles out none. While being simple, this framework has numerous extensions and applications. Here we lay out the basic concepts and definitions; show that the deductive power of our formalism is similar to that of Peano's Arithmetic; prove a strong normalization theorem; and exhibit a mapping from natural deduction derivations to an applied λ -calculus, à la (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  39.  6
    Fragments of first-order logic.Ian Pratt-Hartmann - 2023 - Oxford: Oxford University Press.
    A sentence of first-order logic is satisfiable if it is true in some structure, and finitely satisfiable if it is true in some finite structure. The question arises as to whether there exists an algorithm for determining whether a given formula of first-order logic is satisfiable, or indeed finitely satisfiable. This question was answered negatively in 1936 by Church and Turing (for satisfiability) and in 1950 by Trakhtenbrot (for finite satisfiability).In contrast, the satisfiability and finite satisfiability (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  40.  52
    Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus.Wil Dekkers, Martin Bunder & Henk Barendregt - 1998 - Archive for Mathematical Logic 37 (5-6):327-341.
    Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers 4 systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators, or in a more direct way, in which derivations are not (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  41.  45
    Searching for Deep Disagreement in Logic: The Case of Dialetheism.Ben Martin - 2019 - Topoi 40 (5):1127-1138.
    According to Fogelin’s account of deep disagreements, disputes caused by a clash in framework propositions are necessarily rationally irresolvable. Fogelin’s thesis is a claim about real-life, and not purely hypothetical, arguments: there are such disagreements, and they are incapable of rational resolution. Surprisingly then, few attempts have been made to find such disputes in order to test Fogelin’s thesis. This paper aims to rectify that failure. Firstly, it clarifies Fogelin’s concept of deep disagreement and shows there are several (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  42.  24
    Searching for Deep Disagreement in Logic: The Case of Dialetheism.Ben Martin - 2019 - Topoi 40 (5):1127-1138.
    According to Fogelin’s account of deep disagreements, disputes caused by a clash in framework propositions are necessarily rationally irresolvable. Fogelin’s thesis is a claim about real-life, and not purely hypothetical, arguments: there are such disagreements, and they are incapable of rational resolution. Surprisingly then, few attempts have been made to find such disputes in order to test Fogelin’s thesis. This paper aims to rectify that failure. Firstly, it clarifies Fogelin’s concept of deep disagreement and shows there are several (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  43.  50
    Paraconsistent Logic: Consistency, Contradiction and Negation.Walter Carnielli & Marcelo Esteban Coniglio - 2016 - Basel, Switzerland: Springer International Publishing. Edited by Marcelo Esteban Coniglio.
    This book is the first in the field of paraconsistency to offer a comprehensive overview of the subject, including connections to other logics and applications in information processing, linguistics, reasoning and argumentation, and philosophy of science. It is recommended reading for anyone interested in the question of reasoning and argumentation in the presence of contradictions, in semantics, in the paradoxes of set theory and in the puzzling properties of negation in logic programming. Paraconsistent logic comprises a major logical theory (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   39 citations  
  44.  20
    A note on the firstorder logic of complete BL‐chains.Petr Hájek & Franco Montagna - 2008 - Mathematical Logic Quarterly 54 (4):435-446.
    In [10] it is claimed that the set of predicate tautologies of all complete BL-chains and the set of all standard tautologies coincide. As noticed in [11], this claim is wrong. In this paper we show that a complete BL-chain B satisfies all standard BL-tautologies iff for any transfinite sequence of elements of B, the condition ∧i ∈ I = 2 holds in B.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  45. First-order conditional logic for default reasoning revisited.Nir Friedman, Joseph Halpern, Koller Y. & Daphne - 2000 - Acm Trans. Comput. Logic 1 (2):175--207.
     
    Export citation  
     
    Bookmark   2 citations  
  46.  26
    Per Lindström. First order predicate logic with generalized quantifiers. Theoria, vol. 32 (1966), pp. 186–195.G. Fuhrken - 1970 - Journal of Symbolic Logic 34 (4):650-650.
  47. Refining Labelled Systems for Modal and Constructive Logics with Applications.Tim Lyon - 2021 - Dissertation, Technischen Universität Wien
    This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic paradigms: labelled and nested sequent calculi. The formalism of labelled sequents has been successful in that cut-free calculi in possession of desirable proof-theoretic properties can be automatically generated for large classes of logics. Despite these qualities, labelled systems make use of a complicated syntax that explicitly incorporates the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  48. Preference logic, conditionals and solution concepts in games.Johan van Benthem - unknown
    Preference is a basic notion in human behaviour, underlying such varied phenomena as individual rationality in the philosophy of action and game theory, obligations in deontic logic (we should aim for the best of all possible worlds), or collective decisions in social choice theory. Also, in a more abstract sense, preference orderings are used in conditional logic or non-monotonic reasoning as a way of arranging worlds into more or less plausible ones. The field of preference logic (cf. Hansson [10]) studies (...)
     
    Export citation  
     
    Bookmark   25 citations  
  49.  34
    Epsilon substitution for first- and second-order predicate logic.Grigori Mints - 2013 - Annals of Pure and Applied Logic 164 (6):733-739.
    The epsilon substitution method was proposed by D. Hilbert as a tool for consistency proofs. A version for first order predicate logic had been described and proved to terminate in the monograph “Grundlagen der Mathematik”. As far as the author knows, there have been no attempts to extend this approach to the second order case. We discuss possible directions for and obstacles to such extensions.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  50. A first course in logic: an introduction to model theory, proof theory, computability, and complexity.Shawn Hedman - 2004 - New York: Oxford University Press.
    The ability to reason and think in a logical manner forms the basis of learning for most mathematics, computer science, philosophy and logic students. Based on the author's teaching notes at the University of Maryland and aimed at a broad audience, this text covers the fundamental topics in classical logic in an extremely clear, thorough and accurate style that is accessible to all the above. Covering propositional logic, first-order logic, and second-order logic, as well as proof theory, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
1 — 50 / 1000