default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLarisa Maksimova
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2011
[j14]Larisa Maksimova:
Interpolation and Definability over the Logic Gl. Stud Logica 99(1-3): 249-267 (2011)- 2010
- [j13]Larisa Maksimova:
Problem of restricted interpolation in superintuitionistic and some modal logics. Log. J. IGPL 18(3): 367-380 (2010) - 2007
- [j12]Larisa Maksimova:
On Modal Grzegorczyk Logic. Fundam. Informaticae 81(1-3): 203-210 (2007) - 2006
- [j11]Larisa Maksimova:
Definability and Interpolation in Non-Classical Logics. Stud Logica 82(2): 271-291 (2006) - [j10]Larisa Maksimova:
Projective Beth Property in Extensions of Grzegorczyk Logic. Stud Logica 83(1-3): 365-391 (2006) - 2003
- [j9]Larisa Maksimova:
Complexity of some problems in positive and related calculi. Theor. Comput. Sci. 303(1): 171-185 (2003) - 2002
- [j8]Larisa Maksimova:
Complexity of Interpolation and Related Problems in Positive Calculi. J. Symb. Log. 67(1): 397-408 (2002) - 2000
- [j7]Larisa Maksimova:
Intuitionistic logic and implicit definability. Ann. Pure Appl. Log. 105(1-3): 83-102 (2000) - [j6]Larisa Maksimova:
Strongly Decidable Properties of Modal and Intuitionistic Calculi. Log. J. IGPL 8(6): 797-819 (2000) - 1999
- [j5]Larisa Maksimova:
Temporal logics of "the next" do not have the Beth property. J. Appl. Non Class. Logics 1(1): 73-76 (1999) - 1995
- [j4]Larisa Maksimova:
On variable separation in modal and superintuitionistic logics. Stud Logica 55(1): 99-112 (1995) - 1991
- [j3]Larisa Maksimova:
Amalgamation and interpolation in normal modal logics. Stud Logica 50(3-4): 457-471 (1991) - 1989
- [j2]Larisa L. Maksimova:
Definability theorems in normal extensions of the probability logic. Stud Logica 48(4): 495-507 (1989) - 1986
- [j1]Larisa L. Maksimova:
On maximal intermediate logics with the disjunction property. Stud Logica 45(1): 69-75 (1986)
Conference and Workshop Papers
- 2012
- [c7]Larisa Maksimova:
Interpolation and Beth Definability over the Minimal Logic. Advances in Modal Logic 2012: 459-463 - 2006
- [c6]Larisa Maksimova:
On Interpolation Problem in Paraconsistent Extensions of the Minimal Logic. WoLLIC 2006: 107-119 - 2005
- [c5]Larisa Maksimova:
Interpolation and Joint Consistency. We Will Show Them! (2) 2005: 293-306 - 2003
- [c4]Larisa Maksimova, Andrei Voronkov:
Complexity of Some Problems in Modal and Intuitionistic Calculi. CSL 2003: 397-412 - 2002
- [c3]Larisa Maksimova:
Restricted Interpolation in Modal Logics. Advances in Modal Logic 2002: 297-312 - 2000
- [c2]Larisa Maksimova:
Projective Beth's Properties in Infinite Slice Extensions of the Modal Logic K4. Advances in Modal Logic 2000: 349-363 - 1996
- [c1]Larisa Maksimova:
Interpolation in Superintuitionistic and Modal Predicate Logics with Equality. Advances in Modal Logic 1996: 133-140
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:17 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:
