Propositional discourse logic

DOI10.1007/s11229-013-0297-xzbMath1310.03040OpenAlexW2078907763MaRDI QIDQ484942

Michał Walicki, Sjur Dyrkolbotn

Publication date: 8 January 2015

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11229-013-0297-x

zbMATH Keywords

classical logiccircularitygraph normal formkernels of digraphssemantic paradox

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic of natural languages (03B65)

Related Items

The elimination of direct self-reference ⋮ A UNIFIED THEORY OF TRUTH AND PARADOX ⋮ A GRAPH-THEORETIC ANALYSIS OF THE SEMANTIC PARADOXES ⋮ Beliefs supported by binary arguments ⋮ RESOLVING INFINITARY PARADOXES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expressive power of digraph solvability
• Finding kernels or solving SAT
• Graph theoretical structures in logic programs and default theories
• The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness
• On kernels and semikernels of digraphs
• Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
• A graph-theoretic approach to default logic
• On kernels, defaults and even graphs
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Reference, paradoxes and truth
• Modal provability foundations for argumentation networks
• Perfect graphs, kernels, and cores of cooperative games
• SCC-recursiveness: a general schema for argumentation semantics
• Solutions of irreflexive relations
• Is Yablo's paradox non-circular?
• Graphes Noyau-Parfaits
• Yablo's paradox
• Paradox without Self-Reference
• Outline of a Theory of Truth
• Patterns of paradox
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty