Results 1 to 10 of about 64,991 (246)
Mendler-style Iso-(Co)inductive predicates: a strongly normalizing approach [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We present an extension of the second-order logic AF2 with iso-style inductive and coinductive definitions specifically designed to extract programs from proofs a la Krivine-Parigot by means of primitive (co)recursion principles.
Favio Ezequiel Miranda-Perea +1 more
doaj +4 more sources
IMPLICITINĖ PREDIKATO KVANTIFIKACIJA IR PORT ROYALIO LOGIKA
Problemos, 2004 Straipsnyje analizuojama logikos istorikų Jill Vance Buroker, Sylvaino Auroux ir Jeano-Claude’o Pariente’o pozicija, kad tradicinės logikos pradininkų – Antoine’o Arnauld ir Pierre’o Nicole’io – pažiūrose į kategorinio sakinio semantiką galima įžvelgti ...
Laisvūnas Šopauskas
doaj +24 more sources
KATEGORINIŲ SAKINIŲ SEMANTIKA PORT ROYALIO LOGIKOJE
Problemos, 2004 Straipsnyje analizuojamos tradicinės logikos pradininkų – Antoine’o Arnauld ir Pierre’o Nicole’io – pažiūros į kategorinio sakinio semantiką trimis aspektais: kaip jie suprato sintaksę, elementariųjų dalių prasmes ir sakinio prasmės priklausomybę nuo ...
Laisvūnas Šopauskas
doaj +24 more sources
Neutrosophic Modal Logic [PDF]
Neutrosophic Sets and Systems, 2017 We introduce now for the first time the neutrosophic modal logic. The Neutrosophic Modal Logic includes the neutrosophic operators that express the modalities. It is an extension of neutrosophic predicate logic and of neutrosophic propositional logic.
Florentin Smarandache
doaj +1 more source
Predicate Abstraction via Symbolic Decision Procedures [PDF]
Logical Methods in Computer Science, 2007 We present a new approach for performing predicate abstraction based on symbolic decision procedures. Intuitively, a symbolic decision procedure for a theory takes a set of predicates in the theory and symbolically executes a decision procedure on all ...
Shuvendu K. Lahiri +2 more
doaj +1 more source
A Graph Calculus for Predicate Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e.
Paulo A. S. Veloso, Sheila R. M. Veloso
doaj +1 more source
Intuitionistic Layered Graph Logic: Semantics and Proof Theory [PDF]
Logical Methods in Computer Science, 2018 Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature.
Simon Docherty, David Pym
doaj +1 more source
Meinong and Husserl on Existence. Two Solutions of the Paradox of Non-Existence
Philosophia Scientiæ, 2014 This paper analyzes and compares the attempts at solving the paradox of non-existence put forward by Alexius Meinong and Edmund Husserl. It will be argued that Meinong's solution is not convincing since he retreats from the field of predicate logic, in ...
Giuliano Bacigalupo
doaj +1 more source
Fibred Coalgebraic Logic and Quantum Protocols [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Motivated by applications in modelling quantum systems using coalgebraic techniques, we introduce a fibred coalgebraic logic. Our approach extends the conventional predicate lifting semantics with additional modalities relating conditions on different ...
Daniel Marsden
doaj +1 more source
Henkin on Nominalism and Higher-Order Logic
Principia: An International Journal of Epistemology, 2022 In this paper a proposal by Henkin of a nominalistic interpretation for second and higher-order logic is developed in detail and analysed. It was proposed as a response to Quine’s claim that second and higher-order logic not only are (α) committed to ...
Diego Pinheiro Fernandes
doaj +1 more source