Остановите войну!
for scientists:
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 95 matches
- 2017
- Juan Carlos Agudelo Agudelo, Walter Carnielli:
Polynomial ring calculus for modalities. J. Log. Comput. 27(6): 1853-1870 (2017) - Stefano Aguzzoli, Manuela Busaniche, Brunella Gerla, Miguel Andrés Marcos:
On the category of Nelson paraconsistent lattices. J. Log. Comput. 27(7): 2227-2250 (2017) - Stefano Aguzzoli, Tommaso Flaminio, Sara Ugolini:
Equivalences between subcategories of MTL-algebras via Boolean algebras and prelinear semihoops. J. Log. Comput. 27(8): 2525-2549 (2017) - Natasha Alechina, Wiebe van der Hoek, Brian Logan:
Fair decomposition of group obligations. J. Log. Comput. 27(7): 2043-2062 (2017) - Patrick Allo:
Hard and soft logical information. J. Log. Comput. 27(8): 2505-2524 (2017) - Gabrielle Anderson, David J. Pym:
A Substructural Modal Logic of Utility. J. Log. Comput. 27(5): 1421-1464 (2017) - Carlos Areces, Miguel Campercholi, Daniel Penazzi, Pedro Sánchez Terraf:
The lattice of congruences of a finite line frame. J. Log. Comput. 27(8): 2653-2688 (2017) - Argimiro Arratia, Carlos E. Ortiz:
Methods of class field theory to separate logics over finite residue classes and circuit complexity. J. Log. Comput. 27(7): 1987-2009 (2017) - Edmond Awad, Richard Booth, Fernando Tohmé, Iyad Rahwan:
Judgement aggregation in multi-agent argumentation. J. Log. Comput. 27(1): 227-259 (2017) - Edmond Awad, Martin W. A. Caminada, Gabriella Pigozzi, Mikolaj Podlaszewski, Iyad Rahwan:
Pareto optimality and strategy-proofness in group argument evaluation. J. Log. Comput. 27(8): 2581-2609 (2017) - Matthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Stefan Hetzl, Daniel Weller:
Preface. J. Log. Comput. 27(2): 415 (2017) - Christian W. Bach, Jérémie Cabessa:
Limit-agreeing to disagree. J. Log. Comput. 27(4): 1169-1187 (2017) - Seyed Mohammad Bagheri, Roghieh Safari:
Completeness for linear continuous logic. J. Log. Comput. 27(4): 985-998 (2017) - Adriana Balan, Alexander Kurz, Jirí Velebil:
An institutional approach to positive coalgebraic logic. J. Log. Comput. 27(6): 1799-1824 (2017) - Philippe Balbiani, Tinko Tinchev:
Undecidable problems for modal definability. J. Log. Comput. 27(3): 901-920 (2017) - Ringo Baumann, Hannes Strass:
On the number of bipolar Boolean functions. J. Log. Comput. 27(8): 2431-2449 (2017) - Libor Behounek:
A minimalistic many-valued theory of types. J. Log. Comput. 27(5): 1307-1332 (2017) - Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
Combinatorics of $$\lambda$$-terms: a natural approach. J. Log. Comput. 27(8): 2611-2630 (2017) - Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc:
On the likelihood of normalization in combinatory logic. J. Log. Comput. 27(7): 2251-2269 (2017) - Salem Benferhat, Zied Bouraoui:
Min-based possibilistic DL-Lite. J. Log. Comput. 27(1): 261-297 (2017) - Johan van Benthem, Nick Bezhanishvili, Wesley H. Holliday:
A bimodal perspective on possibility semantics. J. Log. Comput. 27(5): 1353-1389 (2017) - Nick Bezhanishvili, Silvio Ghilardi, Frederik Möllerström Lauridsen:
One-step Heyting Algebras and Hypersequent Calculi with the Bounded Proof Property. J. Log. Comput. 27(7): 2135-2169 (2017) - Nick Bezhanishvili, Sumit Sourabh:
Sahlqvist preservation for topological fixed-point logic. J. Log. Comput. 27(3): 679-703 (2017) - Patrick Blackburn, Thomas Bolander, Torben Braüner, Klaus Frovin Jørgensen:
Completeness and termination for a Seligman-style tableau system. J. Log. Comput. 27(1): 81-107 (2017) - Bernhard Bliem, Reinhard Pichler, Stefan Woltran:
Implementing Courcelle's Theorem in a declarative framework for dynamic programming. J. Log. Comput. 27(4): 1067-1094 (2017) - Egon Börger:
The abstract state machines method for modular design and analysis of programming languages. J. Log. Comput. 27(2): 417-439 (2017) - Marija Boricic:
Suppes-style sequent calculus for probability logic. J. Log. Comput. 27(4): 1157-1168 (2017) - Michael Brand, David L. Dowe:
The IMP game: Learnability, approximability and adversarial learning beyond $$\Sigma0_1$$. J. Log. Comput. 27(7): 2171-2192 (2017) - Emmanuel Chemla, Paul Égré, Benjamin Spector:
Characterizing logical consequence in many-valued logic. J. Log. Comput. 27(7): 2193-2226 (2017) - Matthew Collinson, Kevin McDonald, Simon Docherty, David J. Pym:
Erratum to: A substructural logic for layered graphs. J. Log. Comput. 27(1): 413-414 (2017)
skipping 65 more matches
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-05-25 12:50 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