default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 14 matches
- 2020
- Tarek Sayed Ahmed:
Atom-canonicity in varieties of cylindric algebras with applications to omitting types in multi-modal logic. J. Appl. Non Class. Logics 30(3): 223-271 (2020) - Michele Pra Baldi:
Logics of variable inclusion and the lattice of consequence relations. J. Appl. Non Class. Logics 30(4): 367-381 (2020) - Alex Belikov, Yaroslav I. Petrukhin:
Exactly true and non-falsity logics meeting infectious ones. J. Appl. Non Class. Logics 30(2): 93-122 (2020) - Andreas Fjellstad:
Structural proof theory for first-order weak Kleene logics. J. Appl. Non Class. Logics 30(3): 272-289 (2020) - Chrysafis Hartonas:
Modal translation of substructural logics. J. Appl. Non Class. Logics 30(1): 16-49 (2020) - Marcin Lyczak:
The logic of modal changes LMC. J. Appl. Non Class. Logics 30(1): 50-67 (2020) - Yaroslav I. Petrukhin:
Axiomatization of non-associative generalisations of Hájek's BL and psBL. J. Appl. Non Class. Logics 30(1): 1-15 (2020) - Giuseppe Primiero:
A logic of negative trust. J. Appl. Non Class. Logics 30(3): 193-222 (2020) - Bruno Da Ré, Federico Matias Pailos, Damián Enrique Szmuc, Paula Teijeiro:
Metainferential duality. J. Appl. Non Class. Logics 30(4): 312-334 (2020) - Régis Riveret:
On searching explanatory argumentation graphs. J. Appl. Non Class. Logics 30(2): 123-192 (2020) - Gemma Robles:
A basic quasi-Boolean logic of intuitionistic character. J. Appl. Non Class. Logics 30(4): 291-311 (2020) - Ariel Jonathan Roffé:
Reconstructor: a computer program that uses three-valued logics to represent lack of information in empirical scientific contexts. J. Appl. Non Class. Logics 30(1): 68-91 (2020) - Athanassios Tzouvaras:
Algebraic semantics for propositional superposition logic. J. Appl. Non Class. Logics 30(4): 335-366 (2020) - Correction. J. Appl. Non Class. Logics 30(2): I-II (2020)
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-15 11:05 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint