![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 87 matches
- 2021
- Samson Abramsky
, Nihil Shah:
Relating structure and power: Comonadic semantics for computational resources. J. Log. Comput. 31(6): 1390-1428 (2021) - Nathanael L. Ackerman, Cameron E. Freer, Rehana Patel:
On computable aspects of algebraic and definable closure. J. Log. Comput. 31(1): 2-19 (2021) - Jirí Adámek, Stefan Milius, Henning Urbat:
On the behaviour of coalgebras with side effects and algebras with effectful iteration. J. Log. Comput. 31(6): 1429-1481 (2021) - Thomas Ågotnes, Yì N. Wáng:
Group belief. J. Log. Comput. 31(8): 1959-1978 (2021) - Juan P. Aguilera
, Robert S. Lubarsky:
Feedback hyperjump. J. Log. Comput. 31(1): 20-39 (2021) - Sergei N. Artëmov, Anil Nerode:
Editorial. J. Log. Comput. 31(1): 1 (2021) - Matthias Baaz, Anela Lolic:
Towards a proof theory for Henkin quantifiers. J. Log. Comput. 31(1): 40-66 (2021) - Michael Baur, Thomas Studer
:
Semirings of Evidence. J. Log. Comput. 31(8): 2084-2106 (2021) - Nikolay Bazhenov, Luca San Mauro
:
On the Turing complexity of learning finite families of algebraic structures. J. Log. Comput. 31(7): 1891-1900 (2021) - Sihem Belabbes, Salem Benferhat, Jan Chomicki:
Handling inconsistency in partially preordered ontologies: the Elect method. J. Log. Comput. 31(5): 1356-1388 (2021) - Maciej Bendkowski:
A note on the asymptotic expressiveness of ZF and ZFC. J. Log. Comput. 31(7): 1598-1607 (2021) - Tejas Bhojraj
:
Notions of indifference for genericity: Union sets and subsequence sets. J. Log. Comput. 31(5): 1289-1297 (2021) - Glenn Blanchette, Anthony Robins, Willem Labuschagne:
Modelling supra-classical logic in a Boltzmann neural network: I representation. J. Log. Comput. 31(7): 1758-1799 (2021) - Massimiliano Carrara, Wei Zhu
:
Computational Errors and Suspension in a PWK Epistemic Agent. J. Log. Comput. 31(7): 1740-1757 (2021) - Weiwei Chen:
Guaranteeing Admissibility of Abstract Argumentation Frameworks with Rationality and Feasibility Constraints. J. Log. Comput. 31(8): 2133-2158 (2021) - Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi:
Notes on conjunctive and Quasi degrees. J. Log. Comput. 31(5): 1317-1329 (2021) - Somayeh Chopoghloo
, Morteza Moniri:
A strongly complete axiomatization of intuitionistic temporal logic. J. Log. Comput. 31(7): 1640-1659 (2021) - Marcos Cramer:
Paracomplete truth theory with KFS-definable determinateness. J. Log. Comput. 31(8): 2218-2239 (2021) - Tiziano Dalmonte, Björn Lellmann
, Nicola Olivetti, Elaine Pimentel
:
Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity. J. Log. Comput. 31(1): 67-111 (2021) - Sejla Dautovic
, Dragan Doder, Zoran Ognjanovic:
Logics for reasoning about degrees of confirmation. J. Log. Comput. 31(8): 2189-2217 (2021) - Stéphane Demri, Raul Fervari, Alessio Mansutti
:
Internal proof calculi for modal logics with separating conjunction. J. Log. Comput. 31(3): 832-891 (2021) - Huimin Dong:
Logic of defeasible permission and its dynamics. J. Log. Comput. 31(4): 1158-1193 (2021) - Huimin Dong, Jun Pang, Yì N. Wáng:
Preface of the special issue'Logic, argumentation and AI' in JLC. J. Log. Comput. 31(8): 1901-1902 (2021) - Ivo Düntsch, Wojciech Dzik:
Ideal related algebras and their logics. J. Log. Comput. 31(8): 2159-2188 (2021) - Francesc Esteva, Aldo Figallo Orellano, Tommaso Flaminio, Lluís Godo
:
Logics of formal inconsistency based on distributive involutive residuated lattices. J. Log. Comput. 31(5): 1226-1265 (2021) - Camillo Fiorentini, Mauro Ferrari
:
A forward internal calculus for model generation in S4. J. Log. Comput. 31(3): 771-796 (2021) - Yannick Forster
, Dominik Kirst, Dominik Wehr
:
Completeness theorems for first-order logic analysed in constructive type theory. J. Log. Comput. 31(1): 112-151 (2021) - Stef Frijters
, Frederik Van De Putte:
Classical term-modal logics. J. Log. Comput. 31(4): 1026-1054 (2021) - Emanuele Frittaion
, Michael Rathjen:
Extensional realizability for intuitionistic set theory. J. Log. Comput. 31(2): 630-653 (2021) - Didier Galmiche, Daniel Méry:
Labelled cyclic proofs for separation logic. J. Log. Comput. 31(3): 892-922 (2021)
skipping 57 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-18 07:14 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