default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIfCoLog Journal of Logics and their Applications, Volume 3
Volume 3, Number 1, May 2016
- Lorenzo Magnani:
Editorial Preface. FLAP 3(1): 1-6 (2016) - Katsumi Inoue:
Meta-Level Abduction. 7-36 - Luís Moniz Pereira, Ari Saptawijaya:
Abduction and Beyond in Logic Programming with Application to Morality. 37-72 - Minghui Ma, Ahti-Veikko Pietarinen:
A Dynamic Approach to Peirce's Interrogative Construal of Abductive Logic. 73-104 - Andrés Rivadulla:
Abduction and Beyond. Methodological and Computational Aspects of Creativity in Natural Sciences. 105-122 - Donna E. West:
Course of Action Recommendations and Their Place in Developmental Abduction. 123-152 - Tommaso Bertolotti, Selene Arfini, Lorenzo Magnani:
Abduction: from the Ignorance Problem to the Ignorance Virtue. 153-173
Volume 3, Number 2, August 2016
- Matthias Thimm, Dov M. Gabbay:
Editorial Preface. 175-176 - Bettina Fazzinga, Sergio Flesca, Francesco Parisi, Adriana Pietramala:
Computing or Estimating Extensions' Probabilities over Structured Probabilistic Argumentation Frameworks. 177-200 - Ronald P. Loui:
Against Narrow Optimization and Short Horizons: An Argument-based, Path Planning, and Variable Multiattribute Model for Decision and Risk. 201-240 - Dov M. Gabbay, Odinaldo Rodrigues:
Introducing Bayesian Argumentation Networks. 241-278
Volume 3, Number 3, September 2016
- Heinrich Wansing, Hitoshi Omori, Thomas Macaulay Ferguson:
Editorial Preface. 279-296 - Richard Bradshaw Angell:
Connexive Implication, Modal Logic and Subjunctive Conditionals. 297-308 - Hugh Alexander Montgomery, Richard Routley:
Models for Connexive Logics. 309-316 - Grigory K. Olkhovikov:
On a New Three-Valued Paraconsistent Logic. 317-334 - Grigory K. Olkhovikov:
A Complete, Correct, and Independent Axiomatization of the First-Order Fragment of a Three-Valued Paraconsistent Logic. 335-340 - Luis Estrada-González, Elisangela Ramrez-Camara:
A Comparison of Connexive Logics. 341-356 - Thomas Macaulay Ferguson:
On Arithmetic Formulated Connexively. 357-376 - Matthias Unterhuber:
Beyond System P - Hilbert-Style Convergence Results for Conditional Logics with a Connexive Twist. 377-412 - Heinrich Wansing:
Natural Deduction for Bi-Connexive Logic and a Two-Sorted Typed -Calculus. 413-440 - Norihiro Kamide, Heinrich Wansing:
Completeness of Connexive Heyting-Brouwer Logic. 441-466 - Hitoshi Omori:
A Simple Connexive Extension of the Basic Relevant Logic BD. 467-478 - Nissim Francez:
Natural Deduction for Two Connexive Logics. 479-504 - Hitoshi Omori:
A Note on Francez' Half-Connexive Formula. 505-512
Volume 3, Number 4, October 2016
- Hannes Leitgeb, Iosif Petrakis, Peter Schuster, Helmut Schwichtenberg:
Editorial. 513-516 - Sy-David Friedman:
Evidence for Set-theoretic Truth and the Hyperuniverse Programme. 517-556 - Graham E. Leigh:
Reflecting on Truth. 557-594 - Maria Emilia Maietti, Samuele Maschio:
A Predicative Variant of a Realizability Tripos for the Minimalist Foundation. 595-668 - Joan Rand Moschovakis:
A Translation Theorem For Restricted R-Formulas. 669-680 - Michael Rathjen, Jacob Cook:
Classifying the Provably Total set Functions of KP and KP(P). 681-753
Volume 3, Number 5, December 2016
- Michael Hoche, Jörg H. Siekmann, Peter Szabó:
String Unification is Essentially Infinitary. 755-788 - Michael Abraham, Israel Belfer, Uri J. Schild, Dov M. Gabbay:
Quantum States and Disjunctive Attacks in Talmudic Logic. 789-814 - Daniel Skurt, Hitoshi Omori:
More Modal Semantics without Possible Worlds. 815-846 - Gillman Payette:
Three Grades of Agnostic Involvement. 847-876 - Michel Marti, Thomas Studer:
Intuitionistic Modal Logic made Explicit. 877-902 - Jeff B. Paris, Alena Vencovská:
The Indian Schema Analogy Principles. 903-927
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-11 21:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
