default search action
Heinrich Wansing
Person information
- affiliation: Ruhr University Bochum, Germany
- affiliation (former): Dresden University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 1993
- [b1]Heinrich Wansing
:
The Logic of Information Structures. Free University of Berlin, Dahlem, Germany, Lecture Notes in Computer Science 681, Springer 1993, ISBN 3-540-56734-8
Journal Articles
- 2024
- [j87]Heinrich Wansing
Connexive Logic, Connexivity, and Connexivism: Remarks on Terminology. Stud Logica 112(1-2): 1-35 (2024) - 2023
- [j86]Satoru Niki
On the Provable Contradictions of the Connexive Logics C and C3. J. Philos. Log. 52(5): 1355-1383 (2023) - [j85]Heinrich Wansing
Logical Multilateralism. J. Philos. Log. 52(6): 1603-1636 (2023) - [j84]Christopher Badura
Stit-Logic for Imagination Episodes with voluntary input. Rev. Symb. Log. 16(3): 813-861 (2023) - 2021
- [j83]Sergei P. Odintsov
Routley Star and Hyperintensionality. J. Philos. Log. 50(1): 33-56 (2021) - [j82]Heinrich Wansing
Varieties of entailment: introduction to the special issue. Synth. 198(22-S): 5207-5211 (2021) - [j81]Yaroslav Shramko
The nature of entailment: an informational approach. Synth. 198(22-S): 5241-5261 (2021) - [j80]Yaroslav Shramko
Correction to: The nature of entailment: an informational approach. Synth. 198(22-S): 5263-5264 (2021) - 2020
- [j79]Sergey Drobyshevich
Proof Systems for various FDE-based Modal Logics. Rev. Symb. Log. 13(4): 720-747 (2020) - 2019
- [j78]Grigory K. Olkhovikov
Simplified Tableaux for STIT Imagination Logic. J. Philos. Log. 48(6): 981-1001 (2019) - [j77]Grigory K. Olkhovikov
Inference as Doxastic Agency. Part I: The Basics of Justification Stit Logic. Stud Logica 107(1): 167-194 (2019) - 2018
- [j76]Grigory K. Olkhovikov
An Axiomatic System and a Tableau Calculus for STIT Imagination Logic. J. Philos. Log. 47(2): 259-279 (2018) - [j75]Hitoshi Omori, Heinrich Wansing
On contra-Classical Variants of Nelson Logic N4 and its Classical Extension. Rev. Symb. Log. 11(4): 805-820 (2018) - 2017
- [j74]Heinrich Wansing
A more general general proof theory. J. Appl. Log. 25: 23-46 (2017) - [j73]Heinrich Wansing
Reprint of: A more general general proof theory. J. Appl. Log. 25(Supplement): S25-S47 (2017) - [j72]Hitoshi Omori, Heinrich Wansing
40 years of FDE: An Introductory Overview. Stud Logica 105(6): 1021-1049 (2017) - [j71]Norihiro Kamide
Kripke Completeness of Bi-intuitionistic Multilattice Logic and its Connexive Variant. Stud Logica 105(6): 1193-1219 (2017) - [j70]Sergei P. Odintsov
Disentangling FDE-Based Paraconsistent Modal Logics. Stud Logica 105(6): 1221-1254 (2017) - [j69]Andrea Kruse, Heinrich Wansing
Introduction to the special issue "Doxastic Agency and Epistemic Responsibility". Synth. 194(8): 2667-2671 (2017) - [j68]Heinrich Wansing
Remarks on the logic of imagination. A step towards understanding doxastic control through imagination. Synth. 194(8): 2843-2861 (2017) - 2016
- [j67]Heinrich Wansing, Hitoshi Omori, Thomas Macaulay Ferguson:
Editorial Preface. FLAP 3(3): 279-296 (2016) - [j66]Heinrich Wansing:
Natural Deduction for Bi-Connexive Logic and a Two-Sorted Typed -Calculus. FLAP 3(3): 413-440 (2016) - [j65]Norihiro Kamide, Heinrich Wansing:
Completeness of Connexive Heyting-Brouwer Logic. FLAP 3(3): 441-466 (2016) - [j64]Heinrich Wansing
Falsification, natural deduction and bi-intuitionistic logic. J. Log. Comput. 26(1): 425-450 (2016) - 2015
- [j63]Heinrich Wansing
External Curries. J. Philos. Log. 44(4): 453-471 (2015) - [j62]Sergei P. Odintsov, Heinrich Wansing
The Logic of Generalized Truth Values and the Logic of Bilattices. Stud Logica 103(1): 91-112 (2015) - 2014
- [j61]Agata Ciabattoni
Hypersequent and Display Calculi - a Unified Perspective. Stud Logica 102(6): 1245-1294 (2014) - 2013
- [j60]Heinrich Wansing, Roberto Ciuni, Caroline Willkommen:
Preface. Stud Logica 101(6): 1155-1157 (2013) - 2012
- [j59]Norihiro Kamide, Heinrich Wansing
Proof theory of Nelson's paraconsistent logic: A uniform perspective. Theor. Comput. Sci. 415: 1-38 (2012) - 2011
- [j58]Norihiro Kamide, Heinrich Wansing
Completeness and cut-elimination theorems for trilattice logics. Ann. Pure Appl. Log. 162(10): 816-835 (2011) - [j57]Norihiro Kamide, Heinrich Wansing
A Paraconsistent Linear-time Temporal Logic. Fundam. Informaticae 106(1): 1-23 (2011) - [j56]Heinrich Wansing
Synchronized Linear-Time Temporal Logic. Stud Logica 99(1-3): 365-388 (2011) - 2010
- [j55]Heinrich Wansing
Generalized truth values.: A reply to Dubois. Log. J. IGPL 18(6): 921-935 (2010) - [j54]Sergei P. Odintsov, Heinrich Wansing
Modal logics with Belnapian truth values. J. Appl. Non Class. Logics 20(3): 279-304 (2010) - [j53]Norihiro Kamide, Heinrich Wansing
Combining linear-time temporal logic with constructiveness and paraconsistency. J. Appl. Log. 8(1): 33-61 (2010) - [j52]Philip Kremer, Heinrich Wansing
Editorial Introduction. J. Philos. Log. 39(4): 341-344 (2010) - [j51]Heinrich Wansing
The Power of Belnap: Sequent Systems for SIXTEEN3. J. Philos. Log. 39(4): 369-393 (2010) - [j50]Heinrich Wansing
Intuitionistic Trilattice Logics. J. Log. Comput. 20(6): 1201-1229 (2010) - 2009
- [j49]Walter Alexandre Carnielli, Heinrich Wansing:
Editorial and call for papers: The Non-classical Logics Corner of the Journal of Logic and Computation. J. Log. Comput. 19(6): 987 (2009) - [j48]Norihiro Kamide, Heinrich Wansing
Sequent Calculi for some Trilattice Logics. Rev. Symb. Log. 2(2): 374-395 (2009) - [j47]Yaroslav Shramko
Editorial Introduction. Truth Values: Part I. Stud Logica 91(3): 295-304 (2009) - [j46]Yaroslav Shramko
The Slingshot Argument and Sentential Identity. Stud Logica 91(3): 429-455 (2009) - [j45]Yaroslav Shramko
Editorial Introduction. Truth Values: Part II. Stud Logica 92(2): 143-146 (2009) - 2008
- [j44]Heinrich Wansing:
Constructive negation, implication, and co-implication. J. Appl. Non Class. Logics 18(2-3): 341-364 (2008) - [j43]Sergei P. Odintsov, Heinrich Wansing
Inconsistency-tolerant description logic. Part II: A tableau algorithm for CACLC. J. Appl. Log. 6(3): 343-360 (2008) - [j42]Heinrich Wansing
Editorial and call for papers. J. Log. Comput. 18(4): 495-496 (2008) - [j41]Heinrich Wansing
Suszko's Thesis, Inferential Many-valuedness, and the Notion of a Logical System. Stud Logica 88(3): 405-429 (2008) - [j40]Heinrich Wansing
Erratum to Suszko's Thesis, Inferential Many-valuedness, and the Notion of a Logical System Studia Logica , 88: 405-429, 2008. Stud Logica 89(1): 147 (2008) - 2007
- [j39]Heinrich Wansing
A Note on Negation in Categorial Grammar. Log. J. IGPL 15(3): 271-286 (2007) - [j38]Heinrich Wansing:
Introduction and Call for Papers. J. Log. Comput. 17(1): 5 (2007) - 2006
- [j37]Yaroslav Shramko
Hyper-Contradictions, Generalized Truth Values and Logics of Truth and Falsehood. J. Log. Lang. Inf. 15(4): 403-424 (2006) - [j36]Heinrich Wansing
Connectives Stranger than Tonk. J. Philos. Log. 35(6): 653-660 (2006) - [j35]Heinrich Wansing
Logical Connectives for Constructive Modal Logic. Synth. 150(3): 459-482 (2006) - 2005
- [j34]Yaroslav Shramko
Some Useful 16-Valued Logics: How a Computer Network Should Think. J. Philos. Log. 34(2): 121-153 (2005) - [j33]Heinrich Wansing
From the Editors. Stud Logica 80(2-3): 153-157 (2005) - 2004
- [j32]Heinrich Wansing
Agency and Deontic Logic, J.F. Horty. J. Log. Lang. Inf. 13(3): 379-381 (2004) - [j31]Heinrich Wansing:
Editorial. J. Log. Comput. 14(5): 623 (2004) - 2003
- [j30]Heinrich Wansing
Editorial. J. Log. Comput. 13(4): 451 (2003) - 2002
- [j29]Heinrich Wansing
Review of Modal Logic by P. Blackburn, M. de Rijke, and Y. Venema. Log. J. IGPL 10(4): 457-458 (2002) - [j28]Heinrich Wansing
Diamonds are a Philosopher's Best Friends. J. Philos. Log. 31(6): 591-612 (2002) - [j27]Heinrich Wansing
A Rule-Extension of the Non-Associative Lambek Calculus. Stud Logica 71(3): 443-451 (2002) - 2001
- [j26]Heinrich Wansing:
Editorial and Call for Papers. J. Log. Comput. 11(1): 3-4 (2001) - [j25]Heinrich Wansing
Corner on directions in nonclassical logic. J. Log. Comput. 11(6): 759-760 (2001) - [j24]Roy Dyckhoff, Heinrich Wansing
Editorial. Stud Logica 69(1): 3-4 (2001) - [j23]Roy Dyckhoff, Heinrich Wansing
Editorial. Stud Logica 69(2): 195-196 (2001) - 2000
- [j22]Heinrich Wansing
The Idea of a Proof-Theoretic Semantics and the Meaning of the Logical Operations. Stud Logica 64(1): 3-20 (2000) - [j21]François Lepage, Elias Thijsse, Heinrich Wansing
Introduction. Stud Logica 66(1): 1-4 (2000) - 1999
- [j20]Heinrich Wansing:
Displaying The Modal Logic of Consistency. J. Symb. Log. 64(4): 1573-1590 (1999) - [j19]Heinrich Wansing
Predicate Logics on Display. Stud Logica 62(1): 49-75 (1999) - 1998
- [j18]Heinrich Wansing
Editorial. Log. J. IGPL 6(3): 377-381 (1998) - [j17]Heinrich Wansing
Editorial. Log. J. IGPL 6(5): 667-668 (1998) - [j16]Heinrich Wansing
Translation of Hypersequents into Display Sequents. Log. J. IGPL 6(5): 719-733 (1998) - 1997
- [j15]Heinrich Wansing
Modal Tableaux Based on Residuation. J. Log. Comput. 7(6): 719-731 (1997) - 1996
- [j14]Heinrich Wansing
Reviews. Log. J. IGPL 4(2): 305-308 (1996) - [j13]Elias Thijsse, Heinrich Wansing:
A Fugue on the Themes of Awareness Logic and Correspondence. J. Appl. Non Class. Logics 6(2): 127-136 (1996) - 1995
- [j12]Heinrich Wansing
Strong Cut-Elimination for Constant Domain First-Order S5. Log. J. IGPL 3(5): 797-810 (1995) - [j11]Heinrich Wansing
Tarskian Structured Consequence Relations and Functional Completeness. Math. Log. Q. 41: 73-92 (1995) - [j10]Heinrich Wansing
Semantics-based Nonmonotonic Inference. Notre Dame J. Formal Log. 36(1): 44-54 (1995) - [j9]Heinrich Wansing:
Strong Cut-elimination in Display Logic. Reports Math. Log. 29: 117-131 (1995) - 1994
- [j8]Heinrich Wansing:
Tagungsbericht: Workshop "Proof Theory of Modal Logic". Künstliche Intell. 8(1): 33 (1994) - [j7]Heinrich Wansing
Sequent Calculi for Normal Modal Proposisional Logics. J. Log. Comput. 4(2): 125-142 (1994) - 1993
- [j6]Heinrich Wansing
Informational interpretation of substructural propositional logics. J. Log. Lang. Inf. 2(4): 285-308 (1993) - [j5]Heinrich Wansing
Functional completeness for subsystems of intuitionistic propositional logic. J. Philos. Log. 22(3): 303-321 (1993) - 1991
- [j4]Heinrich Wansing:
Addenda and corrigenda to "A general possible worlds framework for reasoning about knowledge and belief". Stud Logica 50(2): 359 (1991) - 1990
- [j3]Heinrich Wansing
A general possible worlds framework for reasoning about knowledge and belief. Stud Logica 49(4): 523-539 (1990) - 1989
- [j2]Heinrich Wansing
Bemerkungen Zur Semantik Nicht-Normaler Möglicher Welten. Math. Log. Q. 35(6): 551-557 (1989) - 1988
- [j1]David Pearce, Heinrich Wansing
On the methodology of possible worlds semantics. I. Correspondence theory. Notre Dame J. Formal Log. 29(4): 482-496 (1988)
Conference and Workshop Papers
- 2020
- [c6]Hitoshi Omori, Heinrich Wansing:
An Extension of Connexive Logic C. AiML 2020: 503-522 - 2010
- [c5]Heinrich Wansing:
Proofs, Disproofs, and Their Duals. Advances in Modal Logic 2010: 483-505 - 2006
- [c4]Heinrich Wansing:
Tableaux for multi-agent deliberative-stit logic. Advances in Modal Logic 2006: 503-520 - 2004
- [c3]Heinrich Wansing:
Connexive Modal Logic. Advances in Modal Logic 2004: 367-383 - 1998
- [c2]Michael Zakharyaschev, Krister Segerberg, Maarten de Rijke, Heinrich Wansing:
The Origins of Modern Modal Logic. Advances in Modal Logic 1998 - 1990
- [c1]Heinrich Wansing
Formulas-as-types for a Hierarchy of Sublogics of Intuitionistic Propositional Logic. Nonclassical Logics and Information Processing 1990: 125-145
Parts in Books or Collections
- 2011
- [p4]Caroline Semmling, Heinrich Wansing
Reasoning About Belief Revision. Belief Revision meets Philosophy of Science 2011: 303-328 - 2009
- [p3]David Makinson, Jacek Malinowski, Heinrich Wansing
From Logic to Mathematical Philosophy. Towards Mathematical Philosophy 2009: 1-7 - 2004
- [p2]Heinrich Wansing
Action-Theoreticaspects of Theory Choice. Logic, Epistemology, and the Unity of Science 2004: 419-435 - 1996
- [p1]Dov M. Gabbay, Heinrich Wansing:
What is Negation in a System? Negation in Structured Consequence Relations. Logic, Action, and Information 1996: 328-350
Editorship
- 2009
- [e7]David Makinson, Jacek Malinowski, Heinrich Wansing
Towards Mathematical Philosophy. Trends in logic 28, Springer 2009, ISBN 978-1-4020-9083-7 [contents] - 2008
- [e6]Steffen Hölldobler, Carsten Lutz, Heinrich Wansing
Logics in Artificial Intelligence, 11th European Conference, JELIA 2008, Dresden, Germany, September 28 - October 1, 2008. Proceedings. Lecture Notes in Computer Science 5293, Springer 2008, ISBN 978-3-540-87802-5 [contents] - 2005
- [e5]Renate A. Schmidt, Ian Pratt-Hartmann, Mark Reynolds, Heinrich Wansing:
Advances in Modal Logic 5, papers from the fifth conference on "Advances in Modal logic," held in Manchester, UK, 9-11 September 2004. King's College Publications 2005, ISBN 1-904987-22-2 [contents] - 2002
- [e4]Frank Wolter, Heinrich Wansing, Maarten de Rijke, Michael Zakharyaschev:
Advances in Modal Logic 3, papers from the third conference on "Advances in Modal logic," held in Leipzig, Germany, 4-7 October 2000. World Scientific 2002, ISBN 981-238-179-1 [contents] - 2000
- [e3]Michael Zakharyaschev, Krister Segerberg, Maarten de Rijke, Heinrich Wansing:
Advances in Modal Logic 2, papers from the second workshop on "Advances in Modal logic," held in Uppsala, Sweden, 16-18 October 1998. CSLI Publications 2000, ISBN 1-57586-271-9 [contents] - 1998
- [e2]Marcus Kracht, Maarten de Rijke, Heinrich Wansing, Michael Zakharyaschev:
Advances in Modal Logic 1, papers from the first workshop on "Advances in Modal logic," held in Berlin, Germany, 8-10 October 1996. CSLI Publications 1998, ISBN 1-57586-102-X [contents] - 1992
- [e1]David Pearce, Heinrich Wansing
Nonclassical Logics and Information Processing, International Workshop, Berlin, Germany, November 9-10, Proceedings. Lecture Notes in Computer Science 619, Springer 1992, ISBN 3-540-55745-8 [contents]
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST 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: