|
31
|
A New Logical Characterisation of Stable Models and Answer Sets
– David Pearce
- 1997
|
|
1
|
Kripke Completeness of First-Order Constructive Logics with Strong Negation
– Hasuo Ichiro Kashima, Kashima Ryo
|
|
|
(to appear in J. Salerno, ed., New Essays on the Knowability Paradox, Oxford: Oxford University Press) Tennant’s Troubles
– Timothy Williamson
|
|
1
|
Implicit Programming and the Logic of Constructible Duality
– Cflcopyright Anna L. Patterson, L. Patterson
|
|
|
Paraconsistent Computation Tree Logic
– Ken Kaneiwa, Norihiro Kamide
- 2010
|
|
|
Paraconsistent Computation Tree Logic ∗1 1 Paraconsistent Computation Tree Logic ∗1
– Ken Kaneiwa, Norihiro Kamide
|
|
28
|
Logics of Formal Inconsistency
– Walter Carnielli, Marcelo E. Coniglio, João Marcos
- 2001
|
|
1
|
Back and Forth Semantics for Normal, Disjunctive and Extended Logic Programs
– David Pearce
- 1998
|
|
1
|
Assumption Sets for Extended Logic Programs
– Thomas Eiter, Nicola Leone, David Pearce
|
|
|
Paraconsistent Description Logics Revisited
– Norihiro Kamide
|
|
2
|
Exponentials as Projections from Paraconsistent Logics
– Anna Patterson, Tom Costello
- 1997
|
|
|
Modelling Truthmaking
– Greg Restall
- 1998
|
|
1
|
Notes on Situation Theory and Channel Theory
– Greg Restall
- 1996
|
|
6
|
Epistemic Dynamics and Protocol Information
– Tomohiro Hoshi
- 2001
|
|
|
BonJour, L. [1985], The Structure of Empirical Knowledge (Cambridge,
– W. A. Roche, Philosophical Studies
|
|
4
|
Clues to the paradoxes of knowability: reply to Dummett and Tennant. Analysis 62
– Berit Brogaard, Joe Salerno
|
|
|
doi:10.1111/j.1755-2567.2011.01119.x Everything is Knowable – How to Get to Know Whether a Proposition is Truetheo_1119 1..22
– Hans Van Ditmarsch, Wiebe Van, Der Hoek
- 2012
|
|
|
How to Build Your Own Paraconsistent Logic: An Introduction To . . .
– Walter A. Carnielli
|
|
36
|
A Taxonomy of C-systems
– Walter A. Carnielli, et al.
- 2002
|
