default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKosta Dosen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j49]Kosta Dosen, Milos Adzic
:
Gödel on Deduction. Stud Logica 107(1): 31-51 (2019)- 2018
- [j48]Kosta Dosen, Milos Adzic:
Gödel's Natural Deduction. Stud Logica 106(2): 397-415 (2018) - 2017
- [j47]Kosta Dosen, Zoran Petric:
Representing Conjunctive Deductions by Disjunctive Deductions. Rev. Symb. Log. 10(1): 145-157 (2017) - 2016
- [j46]Milos Adzic, Kosta Dosen:
Gödel's Notre Dame Course. Bull. Symb. Log. 22(4): 469-481 (2016) - [p2]Kosta Dosen:
On the Paths of Categories. Advances in Proof-Theoretic Semantics 2016: 65-77 - [p1]Kosta Dosen:
Comments on an Opinion. Advances in Proof-Theoretic Semantics 2016: 189-193 - 2015
- [j45]Kosta Dosen, Zoran Petric:
Weak Cat-Operads. Log. Methods Comput. Sci. 11(1) (2015) - [j44]Kosta Dosen, Zoran Petric:
A Planarity Criterion for Graphs. SIAM J. Discret. Math. 29(4): 2160-2165 (2015) - 2014
- [i1]Kosta Dosen:
On Sets of Premises. CoRR abs/1412.6783 (2014) - 2013
- [j43]Kosta Dosen, Zoran Petric:
Syntax for split preorders. Ann. Pure Appl. Log. 164(4): 443-481 (2013) - [j42]Kosta Dosen, Zoran Petric:
Graphs of plural cuts. Theor. Comput. Sci. 484: 41-55 (2013) - 2012
- [j41]Kosta Dosen, Zoran Petric:
Intermutation. Appl. Categorical Struct. 20(1): 43-95 (2012) - [j40]Kosta Dosen, Zoran Petric:
Isomorphic formulae in classical propositional logic. Math. Log. Q. 58(1-2): 5-17 (2012) - [j39]Kosta Dosen, Zoran Petric:
Shuffles and concatenations in the construction of graphs. Math. Struct. Comput. Sci. 22(6): 904-930 (2012) - 2010
- [j38]Kosta Dosen, Zoran Petric:
Coherence for monoidal endofunctors. Math. Struct. Comput. Sci. 20(4): 523-543 (2010) - [j37]Kosta Dosen, Zoran Petric:
Coherence for monoidal monads and comonads. Math. Struct. Comput. Sci. 20(4): 545-561 (2010)
2000 – 2009
- 2009
- [j36]Kosta Dosen, Zoran Petric:
Coherence in linear predicate logic. Ann. Pure Appl. Log. 158(1-2): 125-153 (2009) - 2008
- [j35]Kosta Dosen, Zoran Petric:
Equality of proofs for linear equality. Arch. Math. Log. 47(6): 549-565 (2008) - 2007
- [j34]Kosta Dosen, Zoran Petric:
Medial commutativity. Ann. Pure Appl. Log. 146(2-3): 237-255 (2007) - 2006
- [j33]Kosta Dosen, Zoran Petric:
Coherence for star-autonomous categories. Ann. Pure Appl. Log. 141(1-2): 225-242 (2006) - [j32]Kosta Dosen, Zana Kovijanic Vukicevic, Zoran Petric:
A New Proof of the Faithfulness of Brauer's Representation of Temperley-lieb Algebras. Int. J. Algebra Comput. 16(5): 959-968 (2006) - [j31]Kosta Dosen, Zoran Petric:
Associativity as commutativity. J. Symb. Log. 71(1): 217-226 (2006) - [j30]Kosta Dosen:
Models of Deduction. Synth. 148(3): 639-657 (2006) - 2005
- [c3]Kosta Dosen, Zoran Petric:
Negation and Involutive Adjunctions. We Will Show Them! (1) 2005: 577-586 - 2003
- [j29]Kosta Dosen:
Identity of proofs based on normalization and generality. Bull. Symb. Log. 9(4): 477-503 (2003) - [j28]Kosta Dosen, Zoran Petric:
Generality of proofs and its Brauerian representation. J. Symb. Log. 68(3): 740-750 (2003) - [j27]Kosta Dosen, Zoran Petric:
A Brauerian representation of split preorders. Math. Log. Q. 49(6): 579-586 (2003) - 2002
- [j26]Kosta Dosen, Zoran Petric:
Bicartesian Coherence. Stud Logica 71(3): 331-353 (2002) - 2001
- [j25]Kosta Dosen, Zoran Petric:
The Maximality of Cartesian Categories. Math. Log. Q. 47(1): 137-144 (2001) - [c2]Kosta Dosen, Zoran Petric:
Coherent Bicartesian and Sesquicartesian Categories. Proof Theory in Computer Science 2001: 78-92 - [c1]Kosta Dosen, Zoran Petric:
The Typed Bohm Theorem. BOTH 2001: 117-129 - 2000
- [j24]Mirjana Borisavljevic, Kosta Dosen, Zoran Petric:
On permuting cut with contraction. Math. Struct. Comput. Sci. 10(2): 99-136 (2000)
1990 – 1999
- 1999
- [j23]Kosta Dosen, Zoran Petric:
Cartesian Isomorphisms Are Symmetric Monoidal: A Justification of Linear Logic. J. Symb. Log. 64(1): 227-242 (1999) - 1997
- [j22]Kosta Dosen, Zoran Petric:
Isomorphic Objects in Symmetric Monoidal Closed Categories. Math. Struct. Comput. Sci. 7(6): 639-662 (1997) - 1996
- [j21]Kosta Dosen:
Deductive completeness. Bull. Symb. Log. 2(3): 243-283 (1996) - 1993
- [j20]Kosta Dosen:
Rudimentary Kripke Models for the Intuitionistic Propositional Calculus. Ann. Pure Appl. Log. 62(1): 21-49 (1993) - 1992
- [j19]Kosta Dosen:
Modal logic as metalogic. J. Log. Lang. Inf. 1(3): 173-201 (1992) - [j18]Kosta Dosen:
Modal translations in substructural logics. J. Philos. Log. 21(3): 283-336 (1992) - [j17]Kosta Dosen:
The first axiomatization of relevant logic. J. Philos. Log. 21(4): 339-356 (1992) - [j16]Kosta Dosen:
A Brief Survey of Frames for the Lambek Calculus. Math. Log. Q. 38(1): 179-187 (1992) - [j15]Kosta Dosen:
Nonmodal Classical Linear Predicate Logic is a Fragment of Intuitionistic Linear Logic. Theor. Comput. Sci. 102(1): 207-214 (1992) - 1991
- [j14]Kosta Dosen:
Rudimentary Beth Models and Conditionally Rudimentary Kripke Models for the Heyting Propositional Calculus. J. Log. Comput. 1(5): 613-634 (1991) - [j13]Kosta Dosen:
Ancestral Kripke Models and Nonhereditary Kripke Models for the Heyting Propositional Calculus. Notre Dame J. Formal Log. 32(4): 580-597 (1991)
1980 – 1989
- 1989
- [j12]Kosta Dosen:
Logical Constants as Punctuation Marks. Notre Dame J. Formal Log. 30(3): 362-381 (1989) - [j11]Kosta Dosen:
Sequent-systems and groupoid models. II. Stud Logica 48(1): 41-65 (1989) - [j10]Kosta Dosen:
Duality between modal algebras and neighbourhood frames. Stud Logica 48(2): 219-234 (1989) - 1988
- [j9]Kosta Dosen, Peter Schroeder-Heister:
Uniqueness, Definability and Interpolation. J. Symb. Log. 53(2): 554-570 (1988) - [j8]Kosta Dosen:
Sequent-systems and groupoid models. I. Stud Logica 47(4): 353-385 (1988) - 1987
- [j7]Kosta Dosen:
A Note on Gentzen's Decision Procedure for Intuitionistic Propositional Logic. Math. Log. Q. 33(5): 453-456 (1987) - 1985
- [j6]Kosta Dosen:
Sequent-Systems for Modal Logic. J. Symb. Log. 50(1): 149-168 (1985) - [j5]Kosta Dosen:
A Completeness Theorem for the Lambek Calculus of Syntactic Categories. Math. Log. Q. 31(14-18): 235-241 (1985) - [j4]Kosta Dosen:
An intuitionistic Sheffer function. Notre Dame J. Formal Log. 26(4): 479-482 (1985) - [j3]Kosta Dosen:
Models for stronger normal intuitionistic modal logics. Stud Logica 44(1): 39-70 (1985) - 1981
- [j2]Kosta Dosen:
A reduction of classical propositional logic to the conjunction-negation fragment of an intuitionistic relevant logic. J. Philos. Log. 10(4): 399-408 (1981)
1970 – 1979
- 1978
- [j1]Kosta Dosen:
A note on the law of identity and the converse Parry property. Notre Dame J. Formal Log. 19(1): 174-176 (1978)
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-04-24 23:15 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:
