Tinko Tinchev

35 papers B 6Misc 1Journal 22Unranked 6
YearRankTypeTitle / Venue / Authors
2025 J jnl
Correspondence Problems for Classes of Postlinear Orders.
Logica Universalis
Grigor Kolev, Tinko Tinchev
2025 J jnl
Intuitionistic modal logic LIK4 is decidable.
CoRR
Philippe Balbiani, Çigdem Gencer, Tinko Tinchev
2025 J jnl
Modal definability in Euclidean modal logics.
CoRR
Philippe Balbiani, Tinko Tinchev
2025 J jnl
On the Definability Problem of First-Order Sentences by Propositional Intuitionistic Formulas.
Axioms
Grigor Kolev, Tinko Tinchev
2023 J jnl
Remarks about the unification types of some locally tabular normal modal logics.
Log. J. IGPL
Philippe Balbiani, Çigdem Gencer, Maryam Rostamigiv, Tinko Tinchev
2022 J jnl
About the unification type of $\mathbf {K}+\square \square \bot $.
Ann. Math. Artif. Intell.
Philippe Balbiani, Çigdem Gencer, Maryam Rostamigiv, Tinko Tinchev
2022 J jnl
Modal Definability: Two Commuting Equivalence Relations.
Logica Universalis
Yana Rumenova, Tinko Tinchev
2020 — conf
About the unification type of K+☐☐⊥.
UNIF
Philippe Balbiani, Çigdem Gencer, Maryam Rostamigiv, Tinko Tinchev
2020 J jnl
About the unification types of the modal logics determined by classes of deterministic frames.
CoRR
Philippe Balbiani, Çigdem Gencer, Maryam Rostamigiv, Tinko Tinchev
2019 — conf
Decidable and Undecidable Problems for First-Order Definability and Modal Definability.
TbiLLC
Philippe Balbiani, Tinko Tinchev
2018 J jnl
Elementary Unification in Modal Logic KD45.
FLAP
Philippe Balbiani, Tinko Tinchev
2018 J jnl
Modal correspondence theory in the class of all Euclidean frames.
J. Log. Comput.
Philippe Balbiani, Dimiter Georgiev, Tinko Tinchev
2017 J jnl
Mixed algebras and their logics.
J. Appl. Non Class. Logics
Ivo Düntsch, Ewa Orlowska, Tinko Tinchev
2017 J jnl
Undecidable problems for modal definability.
J. Log. Comput.
Philippe Balbiani, Tinko Tinchev
2016 B conf
Unification in modal logic Alt
Advances in Modal Logic
Philippe Balbiani, Tinko Tinchev
2014 J jnl
Definability and Canonicity for Boolean Logic with a Binary Relation.
Fundam. Informaticae
Philippe Balbiani, Tinko Tinchev
2014 B conf
Definability and Computability for PRSPDL.
Advances in Modal Logic
Philippe Balbiani, Tinko Tinchev
2014 B conf
Flexible Noisy Text Correction.
Document Analysis Systems
Andrey Sariev, Vladislav Nenchev, Stefan Gerdjikov, Petar Mitankin, Hristo Ganchev, Stoyan Mihov, Tinko Tinchev
2014 — conf
Unification in the normal modal logic Alt1.
UNIF
Philippe Balbiani, Tinko Tinchev
2010 J jnl
Boolean logics with relations.
J. Log. Algebraic Methods Program.
Philippe Balbiani, Tinko Tinchev
2010 B conf
Logics of Space with Connectedness Predicates: Complete Axiomatizations.
Advances in Modal Logic
Tinko Tinchev, Dimiter Vakarelov
2009 Misc conf
Large Vocabulary Continuous Speech Recognition for Bulgarian.
RANLP
Petar Mitankin, Stoyan Mihov, Tinko Tinchev
2008 — conf
Boolean Logics with Relations.
RelMiCS
Philippe Balbiani, Tinko Tinchev
2008 J jnl
Second-order logic on equivalence relations.
J. Appl. Non Class. Logics
G. Georgiev, Tinko Tinchev
2007 J jnl
Dynamic logics of the region-based theory of discrete spaces.
J. Appl. Non Class. Logics
Philippe Balbiani, Tinko Tinchev, Dimiter Vakarelov
2007 J jnl
Line-based affine reasoning in Euclidean plane.
J. Appl. Log.
Philippe Balbiani, Tinko Tinchev
2007 J jnl
Modal Logics for Region-based Theories of Space.
Fundam. Informaticae
Philippe Balbiani, Tinko Tinchev, Dimiter Vakarelov
2006 J jnl
Definability Over the Class of all Partitions.
J. Log. Comput.
Philippe Balbiani, Tinko Tinchev
2004 B conf
Line-Based Affine Reasoning in Euclidean Plane.
JELIA
Philippe Balbiani, Tinko Tinchev
1997 J jnl
Modal Logics for Incidence Geometries.
J. Log. Comput.
Philippe Balbiani, Luis Fariñas del Cerro, Tinko Tinchev, Dimiter Vakarelov
1996 — conf
Geometrical Structures and Modal Logic.
FAPR
Philippe Balbiani, Luis Fariñas del Cerro, Tinko Tinchev, Dimiter Vakarelov
1991 J jnl
An Essay in Combinatory Dynamic Logic
Inf. Comput.
Solomon Passay, Tinko Tinchev
1985 J jnl
PDL with Data Constants.
Inf. Process. Lett.
Solomon Passy, Tinko Tinchev
1985 B conf
Quantifiers in combinatory PDL: completeness, definability, incompleteness.
FCT
Solomon Passy, Tinko Tinchev
1984 — conf
Propositional dynamic logics with counters and stacks.
Symposium on Computation Theory
Tinko Tinchev, Dimiter Vakarelov