Results 31 to 40 of about 23,486 (260)
Superdeduction in Lambda-Bar-Mu-Mu-Tilde [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way.
Clément Houtmann
doaj +1 more source
Classical and fuzzy logic evaluation of students' master theses in Matlab Fuzzy Logic Toolbox software: Dealing with subjectivity in human reasoning [PDF]
Agroznanje, 2018 The two-level evaluation of defined objectives, presented materials and methods and interpretation of results in master theses was done, in order to estimate their scientific contribution and statistical relevance. First level of evaluation was performed
Hajder Đurađ, Mićić Nikola
doaj +1 more source
Towards depth-bounded natural deduction for classical first-order logic [PDF]
, 2021 Summary: In this paper we lay the foundations of a new proof-theory for classical first-order logic that allows for a natural characterization of a notion of inferential depth. The approach we propose here aims towards extending the proof-theoretical framework presented by \textit{M. D'Agostino} et al. [Stud. Log. 108, No.
M. D'Agostino, C. Larese, S. Modgil
openaire +1 more source
Tableau Systems for Epistemic Positional Logics
Bulletin of the Section of Logic, 2021 The goal of the article is twofold. The first one is to provide logics based on positional semantics which will be suitable for the analysis of epistemic modalities such as ‘agent ... knows/beliefs that ...’.
Mateusz Klonowski +2 more
doaj +1 more source
Aristotelian logic and its perspectives
Pensamiento. Revista de Investigación e Información Filosófica, 2017 The legitimacy of Aristotelian logic was questioned in the twentieth century. As a result, the question of whether it should be replaced or restored remains unanswered.
Manuel Correia
doaj +1 more source
Classical System of Martin-Lof's Inductive Definitions is not Equivalent to Cyclic Proofs [PDF]
Logical Methods in Computer Science, 2019 A cyclic proof system, called CLKID-omega, gives us another way of representing inductive definitions and efficient proof search. The 2005 paper by Brotherston showed that the provability of CLKID-omega includes the provability of LKID, first order ...
Stefano Berardi, Makoto Tatsuta
doaj +1 more source
An Integrated First-Order Theory of Points and Intervals over Linear Orders (Part II) [PDF]
Logical Methods in Computer Science, 2020 There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points as a particular case of duration-less intervals.
Willem Conradie +2 more
doaj +1 more source
Logical Methods in Computer Science, 2013 We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing.
Stefan Hetzl, Lutz Straßburger
doaj +1 more source
Philosophia Scientiæ, 2004 Hintikka makes a distinction between two kinds of games: truthconstituting games and truth-seeking games. His well-known game-theoretical semantics for first-order classical logic and its independence-friendly extension belongs to the first class of ...
Denis Bonnay
doaj +1 more source
Comparative Study of Temperature Control in a Heat Exchanger Process [PDF]
Engineering and Technology Journal, 2012 In the present work the dynamic behavior of a plate heat exchanger (PHE) (single pass counter current consists of 24 plates) studied experimentally and theoretically to control the system.
Afraa H. Al-Tae, Safa A. Al-Naimi
doaj +1 more source