default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTinko Tinchev
Person information
- affiliation: St. Clement of Ohrid University of Sofia, Bulgaria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Philippe Balbiani, Çigdem Gencer, Maryam Rostamigiv, Tinko Tinchev
:
Remarks about the unification types of some locally tabular normal modal logics. Log. J. IGPL 31(1): 115-139 (2023)- 2022
- [j16]Philippe Balbiani, Çigdem Gencer, Maryam Rostamigiv, Tinko Tinchev:
About the unification type of $\mathbf {K}+\square \square \bot $. Ann. Math. Artif. Intell. 90(5): 481-497 (2022) - [j15]Yana Rumenova, Tinko Tinchev:
Modal Definability: Two Commuting Equivalence Relations. Logica Universalis 16(1-2): 177-194 (2022) - 2020
- [c13]Philippe Balbiani, Çigdem Gencer, Maryam Rostamigiv, Tinko Tinchev:
About the unification type of K+☐☐⊥. UNIF 2020: 4:1-4:6 - [i1]Philippe Balbiani, Çigdem Gencer, Maryam Rostamigiv, Tinko Tinchev:
About the unification types of the modal logics determined by classes of deterministic frames. CoRR abs/2004.07904 (2020)
2010 – 2019
- 2019
- [c12]Philippe Balbiani, Tinko Tinchev:
Decidable and Undecidable Problems for First-Order Definability and Modal Definability. TbiLLC 2019: 214-236 - 2018
- [j14]Philippe Balbiani, Tinko Tinchev:
Elementary Unification in Modal Logic KD45. FLAP 5(1): 301-318 (2018) - [j13]Philippe Balbiani, Dimiter Georgiev, Tinko Tinchev:
Modal correspondence theory in the class of all Euclidean frames. J. Log. Comput. 28(1): 119-131 (2018) - 2017
- [j12]Ivo Düntsch, Ewa Orlowska, Tinko Tinchev:
Mixed algebras and their logics. J. Appl. Non Class. Logics 27(3-4): 304-320 (2017) - [j11]Philippe Balbiani, Tinko Tinchev:
Undecidable problems for modal definability. J. Log. Comput. 27(3): 901-920 (2017) - 2016
- [c11]Philippe Balbiani, Tinko Tinchev:
Unification in modal logic Alt1. Advances in Modal Logic 2016: 117-134 - 2014
- [j10]Philippe Balbiani, Tinko Tinchev:
Definability and Canonicity for Boolean Logic with a Binary Relation. Fundam. Informaticae 129(4): 301-327 (2014) - [c10]Philippe Balbiani, Tinko Tinchev:
Definability and Computability for PRSPDL. Advances in Modal Logic 2014: 16-33 - [c9]Andrey Sariev, Vladislav Nenchev, Stefan Gerdjikov, Petar Mitankin, Hristo Ganchev, Stoyan Mihov, Tinko Tinchev:
Flexible Noisy Text Correction. Document Analysis Systems 2014: 31-35 - [c8]Philippe Balbiani, Tinko Tinchev:
Unification in the normal modal logic Alt1. UNIF 2014: 26-32 - 2010
- [j9]Philippe Balbiani, Tinko Tinchev:
Boolean logics with relations. J. Log. Algebraic Methods Program. 79(8): 707-721 (2010) - [c7]Tinko Tinchev, Dimiter Vakarelov:
Logics of Space with Connectedness Predicates: Complete Axiomatizations. Advances in Modal Logic 2010: 434-453
2000 – 2009
- 2009
- [c6]Petar Mitankin, Stoyan Mihov, Tinko Tinchev:
Large Vocabulary Continuous Speech Recognition for Bulgarian. RANLP 2009: 246-250 - 2008
- [j8]G. Georgiev, Tinko Tinchev:
Second-order logic on equivalence relations. J. Appl. Non Class. Logics 18(2-3): 229-246 (2008) - [c5]Philippe Balbiani, Tinko Tinchev:
Boolean Logics with Relations. RelMiCS 2008: 4-21 - 2007
- [j7]Philippe Balbiani, Tinko Tinchev, Dimiter Vakarelov:
Modal Logics for Region-based Theories of Space. Fundam. Informaticae 81(1-3): 29-82 (2007) - [j6]Philippe Balbiani, Tinko Tinchev, Dimiter Vakarelov:
Dynamic logics of the region-based theory of discrete spaces. J. Appl. Non Class. Logics 17(1): 39-61 (2007) - [j5]Philippe Balbiani, Tinko Tinchev:
Line-based affine reasoning in Euclidean plane. J. Appl. Log. 5(3): 421-434 (2007) - 2006
- [j4]Philippe Balbiani, Tinko Tinchev:
Definability Over the Class of all Partitions. J. Log. Comput. 16(5): 541-557 (2006) - 2004
- [c4]Philippe Balbiani, Tinko Tinchev:
Line-Based Affine Reasoning in Euclidean Plane. JELIA 2004: 474-486
1990 – 1999
- 1997
- [j3]Philippe Balbiani, Luis Fariñas del Cerro, Tinko Tinchev, Dimiter Vakarelov:
Modal Logics for Incidence Geometries. J. Log. Comput. 7(1): 59-78 (1997) - 1996
- [c3]Philippe Balbiani, Luis Fariñas del Cerro, Tinko Tinchev, Dimiter Vakarelov:
Geometrical Structures and Modal Logic. FAPR 1996: 43-57 - 1991
- [j2]Solomon Passay, Tinko Tinchev:
An Essay in Combinatory Dynamic Logic. Inf. Comput. 93(2): 263-332 (1991)
1980 – 1989
- 1985
- [j1]Solomon Passy, Tinko Tinchev:
PDL with Data Constants. Inf. Process. Lett. 20(1): 35-41 (1985) - [c2]Solomon Passy, Tinko Tinchev:
Quantifiers in combinatory PDL: completeness, definability, incompleteness. FCT 1985: 512-519 - 1984
- [c1]Tinko Tinchev, Dimiter Vakarelov:
Propositional dynamic logics with counters and stacks. Symposium on Computation Theory 1984: 364-374
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 2025-01-21 00:03 CET 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:
