Propositional dynamic logics with counters and stacks. - Tinko Tinchev; Dimiter Vakarelov (Symposium on Computation Theory, 1984)

Quantifiers in combinatory PDL: completeness, definability, incompleteness. - Solomon Passy; Tinko Tinchev (FCT, 1985)

PDL with Data Constants. - Solomon Passy; Tinko Tinchev (Inf. Process. Lett., 1985)

An Essay in Combinatory Dynamic Logic - Solomon Passay; Tinko Tinchev (Inf. Comput., 1991)

Geometrical Structures and Modal Logic. - Philippe Balbiani; Luis Fariñas del Cerro; Tinko Tinchev; Dimiter Vakarelov (FAPR, 1996)

Modal Logics for Incidence Geometries. - Philippe Balbiani; Luis Fariñas del Cerro; Tinko Tinchev; Dimiter Vakarelov (J. Log. Comput., 1997)

Definability Over the Class of all Partitions. - Philippe Balbiani; Tinko Tinchev (J. Log. Comput., 2006)

Modal Logics for Region-based Theories of Space. - Philippe Balbiani; Tinko Tinchev; Dimiter Vakarelov (Fundam. Informaticae, 2007)

Dynamic logics of the region-based theory of discrete spaces. - Philippe Balbiani; Tinko Tinchev; Dimiter Vakarelov (J. Appl. Non Class. Logics, 2007)

Line-based affine reasoning in Euclidean plane. - Philippe Balbiani; Tinko Tinchev (J. Appl. Log., 2007)

Second-order logic on equivalence relations. - G. Georgiev; Tinko Tinchev (J. Appl. Non Class. Logics, 2008)

Large Vocabulary Continuous Speech Recognition for Bulgarian. - Petar Mitankin; Stoyan Mihov; Tinko Tinchev (RANLP, 2009)

Logics of Space with Connectedness Predicates: Complete Axiomatizations. - Tinko Tinchev; Dimiter Vakarelov (Advances in Modal Logic, 2010)

Boolean logics with relations. - Philippe Balbiani; Tinko Tinchev (J. Log. Algebraic Methods Program., 2010)

Definability and Computability for PRSPDL. - Philippe Balbiani; Tinko Tinchev (Advances in Modal Logic, 2014)

Flexible Noisy Text Correction. - Andrey Sariev; Vladislav Nenchev; Stefan Gerdjikov; Petar Mitankin; Hristo Ganchev; Stoyan Mihov; Tinko Tinchev (Document Analysis Systems, 2014)

Unification in the normal modal logic Alt1. - Philippe Balbiani; Tinko Tinchev (UNIF, 2014)

Definability and Canonicity for Boolean Logic with a Binary Relation. - Philippe Balbiani; Tinko Tinchev (Fundam. Informaticae, 2014)

Unification in modal logic Alt1. - Philippe Balbiani; Tinko Tinchev (Advances in Modal Logic, 2016)

Mixed algebras and their logics. - Ivo Düntsch; Ewa Orlowska; Tinko Tinchev (J. Appl. Non Class. Logics, 2017)

Undecidable problems for modal definability. - Philippe Balbiani; Tinko Tinchev (J. Log. Comput., 2017)

Elementary Unification in Modal Logic KD45. - Philippe Balbiani; Tinko Tinchev (FLAP, 2018)

Modal correspondence theory in the class of all Euclidean frames. - Philippe Balbiani; Dimiter Georgiev; Tinko Tinchev (J. Log. Comput., 2018)

Decidable and Undecidable Problems for First-Order Definability and Modal Definability. - Philippe Balbiani; Tinko Tinchev (TbiLLC, 2019)

About the unification type of K+☐☐⊥. - Philippe Balbiani; Çigdem Gencer; Maryam Rostamigiv; Tinko Tinchev (UNIF, 2020)

About the unification types of the modal logics determined by classes of deterministic frames. - Philippe Balbiani; Çigdem Gencer; Maryam Rostamigiv; Tinko Tinchev (CoRR, 2020)

About the unification type of $ mathbf {K}+ square square bot $. - Philippe Balbiani; Çigdem Gencer; Maryam Rostamigiv; Tinko Tinchev (Ann. Math. Artif. Intell., 2022)

Modal Definability: Two Commuting Equivalence Relations. - Yana Rumenova; Tinko Tinchev (Logica Universalis, 2022)

Remarks about the unification types of some locally tabular normal modal logics. - Philippe Balbiani; Çigdem Gencer; Maryam Rostamigiv; Tinko Tinchev (Log. J. IGPL, 2023)