default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeinrich Wansing
- > Home > Persons > Heinrich Wansing
Publications
- 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) - [j68]Heinrich Wansing:
Remarks on the logic of imagination. A step towards understanding doxastic control through imagination. Synth. 194(8): 2843-2861 (2017) - 2016
- [j66]Heinrich Wansing:
Natural Deduction for Bi-Connexive Logic and a Two-Sorted Typed -Calculus. FLAP 3(3): 413-440 (2016) - [j64]Heinrich Wansing:
Falsification, natural deduction and bi-intuitionistic logic. J. Log. Comput. 26(1): 425-450 (2016) - 2010
- [j51]Heinrich Wansing:
The Power of Belnap: Sequent Systems for SIXTEEN3. J. Philos. Log. 39(4): 369-393 (2010) - [c5]Heinrich Wansing:
Proofs, Disproofs, and Their Duals. Advances in Modal Logic 2010: 483-505 - 2008
- [j44]Heinrich Wansing:
Constructive negation, implication, and co-implication. J. Appl. Non Class. Logics 18(2-3): 341-364 (2008) - [j42]Heinrich Wansing:
Editorial and call for papers. J. Log. Comput. 18(4): 495-496 (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
- [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) - [c4]Heinrich Wansing:
Tableaux for multi-agent deliberative-stit logic. Advances in Modal Logic 2006: 503-520 - 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) - [c3]Heinrich Wansing:
Connexive Modal Logic. Advances in Modal Logic 2004: 367-383 - [p2]Heinrich Wansing:
Action-Theoreticaspects of Theory Choice. Logic, Epistemology, and the Unity of Science 2004: 419-435 - 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) - 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) - 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) - 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
- [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 - [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) - [c1]Heinrich Wansing:
Formulas-as-types for a Hierarchy of Sublogics of Intuitionistic Propositional Logic. Nonclassical Logics and Information Processing 1990: 125-145 - 1989
- [j2]Heinrich Wansing:
Bemerkungen Zur Semantik Nicht-Normaler Möglicher Welten. Math. Log. Q. 35(6): 551-557 (1989)
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 21:22 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:
