default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatalin Bimbó
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j25]Joseph McDonald
, Katalin Bimbó:
Topological duality for orthomodular lattices. Math. Log. Q. 69(2): 174-191 (2023)- 2021
- [j24]Katalin Bimbó:
IN MEMORIAM: J. MICHAEL DUNN, 1941-2021. Bull. Symb. Log. 27(4): 519-525 (2021)
2010 – 2019
- 2018
- [c2]Katalin Bimbó:
Inhabitants of Intuitionistic Implicational Theorems. WoLLIC 2018: 1-24 - 2017
- [j23]Katalin Bimbó, J. Michael Dunn:
Introduction. FLAP 4(3) (2017) - [j22]Katalin Bimbó, J. Michael Dunn:
The Emergence of Set-theoretical Semantics for Relevance Logics around 1970. FLAP 4(3) (2017) - [c1]Katalin Bimbó:
On the Decidability of Certain Semi-Lattice Based Modal Logics. TABLEAUX 2017: 44-61 - 2016
- [j21]Katalin Bimbó:
Some relevance logics from the point of view of relational semantics. Log. J. IGPL 24(3): 268-287 (2016) - 2015
- [j20]Katalin Bimbó:
Current Trends in Substructural Logics. J. Philos. Log. 44(6): 609-624 (2015) - [j19]Katalin Bimbó:
The decidability of the intensional fragment of classical linear logic. Theor. Comput. Sci. 597: 1-17 (2015) - 2014
- [j18]Katalin Bimbó, J. Michael Dunn:
Extracting BB′IW Inhabitants of Simple Types From Proofs in the Sequent Calculus ${LT_\to^{t}}$ for Implicational Ticket Entailment. Logica Universalis 8(2): 141-164 (2014) - 2013
- [j17]Katalin Bimbó, J. Michael Dunn:
On the decidability of implicational ticket entailment. J. Symb. Log. 78(1): 214-236 (2013) - 2012
- [j16]Katalin Bimbó, J. Michael Dunn:
New Consecution Calculi for Rt->. Notre Dame J. Formal Log. 53(4): 491-509 (2012) - 2010
- [j15]Katalin Bimbó:
Schönfinkel-type Operators for Classical Logic. Stud Logica 95(3): 355-378 (2010)
2000 – 2009
- 2009
- [j14]Katalin Bimbó, J. Michael Dunn:
Symmetric Generalized Galois Logics. Logica Universalis 3(1): 125-152 (2009) - [j13]Katalin Bimbó:
Dual Gaggle Semantics for Entailment. Notre Dame J. Formal Log. 50(1): 23-41 (2009) - [j12]Katalin Bimbó, J. Michael Dunn, Roger D. Maddux:
Relevance Logics and Relation Algebras. Rev. Symb. Log. 2(1): 102-131 (2009) - 2007
- [j11]Katalin Bimbó:
LEt ® , LR °[^( ~ )], LK and Cutfree Proofs. J. Philos. Log. 36(5): 557-570 (2007) - [j10]Katalin Bimbó:
Functorial Duality for Ortholattices and De Morgan Lattices. Logica Universalis 1(2): 311-333 (2007) - 2005
- [j9]Katalin Bimbó:
Types of I -Free Hereditary Right Maximal Terms. J. Philos. Log. 34(5-6): 607-620 (2005) - [j8]Katalin Bimbó:
The Church-Rosser property in symmetric combinatory logic. J. Symb. Log. 70(2): 536-556 (2005) - [j7]Katalin Bimbó, J. Michael Dunn:
Relational Semantics for Kleene Logic and Action Logic. Notre Dame J. Formal Log. 46(4): 461-490 (2005) - [j6]Katalin Bimbó:
Admissibility of Cut in LC with Fixed Point Combinator. Stud Logica 81(3): 399-423 (2005) - 2004
- [j5]Katalin Bimbó:
Semantics for Dual and Symmetric Combinatory Calculi. J. Philos. Log. 33(2): 125-153 (2004) - 2003
- [j4]Katalin Bimbó:
The Church-Rosser property in dual combinatory logic. J. Symb. Log. 68(1): 132-152 (2003) - 2001
- [j3]Katalin Bimbó:
Semantics for Structurally Free Logics LC+. Log. J. IGPL 9(4): 525-539 (2001) - 2000
- [j2]Katalin Bimbó:
Investigation into Combinatory Systems with Dual Combinators. Stud Logica 66(2): 285-296 (2000)
1990 – 1999
- 1998
- [j1]Katalin Bimbó, J. Michael Dunn:
Two Extensions of the Structurally Free Logic LC*. Log. J. IGPL 6(3): 403-424 (1998)
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-04-24 23:02 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:
