Kosta Dosen

According to our database1, Kosta Dosen authored at least 55 papers between 1978 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Gödel on Deduction.
Stud Logica, 2019

2018
Gödel's Natural Deduction.
Stud Logica, 2018

2017
Representing Conjunctive Deductions by Disjunctive Deductions.
Rev. Symb. Log., 2017

2016
Gödel's Notre Dame Course.
Bull. Symb. Log., 2016

Comments on an Opinion.
Proceedings of the Advances in Proof-Theoretic Semantics., 2016

On the Paths of Categories.
Proceedings of the Advances in Proof-Theoretic Semantics., 2016

2015
A Planarity Criterion for Graphs.
SIAM J. Discret. Math., 2015

Weak Cat-Operads.
Log. Methods Comput. Sci., 2015

2014
On Sets of Premises.
CoRR, 2014

2013
Graphs of plural cuts.
Theor. Comput. Sci., 2013

Syntax for split preorders.
Ann. Pure Appl. Log., 2013

2012
Shuffles and concatenations in the construction of graphs.
Math. Struct. Comput. Sci., 2012

Isomorphic formulae in classical propositional logic.
Math. Log. Q., 2012

Intermutation.
Appl. Categorical Struct., 2012

2010
Coherence for monoidal monads and comonads.
Math. Struct. Comput. Sci., 2010

Coherence for monoidal endofunctors.
Math. Struct. Comput. Sci., 2010

2009
Coherence in linear predicate logic.
Ann. Pure Appl. Log., 2009

2008
Equality of proofs for linear equality.
Arch. Math. Log., 2008

2007
Medial commutativity.
Ann. Pure Appl. Log., 2007

2006
Models of Deduction.
Synth., 2006

Associativity as commutativity.
J. Symb. Log., 2006

A New Proof of the Faithfulness of Brauer's Representation of Temperley-lieb Algebras.
Int. J. Algebra Comput., 2006

Coherence for star-autonomous categories.
Ann. Pure Appl. Log., 2006

2005
Negation and Involutive Adjunctions.
Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume One, 2005

2003
A Brauerian representation of split preorders.
Math. Log. Q., 2003

Generality of proofs and its Brauerian representation.
J. Symb. Log., 2003

Identity of proofs based on normalization and generality.
Bull. Symb. Log., 2003

2002
Bicartesian Coherence.
Stud Logica, 2002

2001
The Maximality of Cartesian Categories.
Math. Log. Q., 2001

The Typed Bohm Theorem.
Proceedings of the Bohm's theorem: applications to Computer Science Theory, 2001

Coherent Bicartesian and Sesquicartesian Categories.
Proceedings of the Proof Theory in Computer Science, International Seminar, 2001

2000
On permuting cut with contraction.
Math. Struct. Comput. Sci., 2000

1999
Cartesian Isomorphisms Are Symmetric Monoidal: A Justification of Linear Logic.
J. Symb. Log., 1999

1997
Isomorphic Objects in Symmetric Monoidal Closed Categories.
Math. Struct. Comput. Sci., 1997

1996
Deductive completeness.
Bull. Symb. Log., 1996

1993
Rudimentary Kripke Models for the Intuitionistic Propositional Calculus.
Ann. Pure Appl. Log., 1993

1992
Nonmodal Classical Linear Predicate Logic is a Fragment of Intuitionistic Linear Logic.
Theor. Comput. Sci., 1992

A Brief Survey of Frames for the Lambek Calculus.
Math. Log. Q., 1992

The first axiomatization of relevant logic.
J. Philos. Log., 1992

Modal translations in substructural logics.
J. Philos. Log., 1992

Modal logic as metalogic.
J. Log. Lang. Inf., 1992

1991
Ancestral Kripke Models and Nonhereditary Kripke Models for the Heyting Propositional Calculus.
Notre Dame J. Formal Log., 1991

Rudimentary Beth Models and Conditionally Rudimentary Kripke Models for the Heyting Propositional Calculus.
J. Log. Comput., 1991

1989
Duality between modal algebras and neighbourhood frames.
Stud Logica, 1989

Sequent-systems and groupoid models. II.
Stud Logica, 1989

Logical Constants as Punctuation Marks.
Notre Dame J. Formal Log., 1989

1988
Sequent-systems and groupoid models. I.
Stud Logica, 1988

Uniqueness, Definability and Interpolation.
J. Symb. Log., 1988

1987
A Note on Gentzen's Decision Procedure for Intuitionistic Propositional Logic.
Math. Log. Q., 1987

1985
Models for stronger normal intuitionistic modal logics.
Stud Logica, 1985

An intuitionistic Sheffer function.
Notre Dame J. Formal Log., 1985

A Completeness Theorem for the Lambek Calculus of Syntactic Categories.
Math. Log. Q., 1985

Sequent-Systems for Modal Logic.
J. Symb. Log., 1985

1981
A reduction of classical propositional logic to the conjunction-negation fragment of an intuitionistic relevant logic.
J. Philos. Log., 1981

1978
A note on the law of identity and the converse Parry property.
Notre Dame J. Formal Log., 1978


  Loading...