![](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 317 matches
- 2022
- Juan P. Aguilera
, Jan Bydzovsky, David Fernández-Duque:
A Non-hyperarithmetical Gödel Logic. LFCS 2022: 1-8 - Matthias Baaz
, Anela Lolic
:
Andrews Skolemization May Shorten Resolution Proofs Non-elementarily. LFCS 2022: 9-24 - Douglas Cenzer
, Richard Krogman:
The Isomorphism Problem for FST Injection Structures. LFCS 2022: 25-36 - Neil J. DeBoer
:
Justification Logic and Type Theory as Formalizations of Intuitionistic Propositional Logic. LFCS 2022: 37-51 - David Fernández-Duque
, Konstnatinos Papafilippou
, Joost J. Joosten
:
Hyperarithmetical Worm Battles. LFCS 2022: 52-69 - Yannick Forster
:
Parametric Church's Thesis: Synthetic Computability Without Choice. LFCS 2022: 70-89 - Christian Hagemeier
, Dominik Kirst
:
Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic. LFCS 2022: 90-111 - Bjørn Kjos-Hanssen
, Saroj Niraula, Soowhan Yoon
:
A Parametrized Family of Tversky Metrics Connecting the Jaccard Distance to an Analogue of the Normalized Information Distance. LFCS 2022: 112-124 - Juha Kontinen
, Arne Meier, Yasir Mahmood:
A Parameterized View on the Complexity of Dependence Logic. LFCS 2022: 125-142 - David Lehnherr
, Zoran Ognjanovic
, Thomas Studer
:
A Logic of Interactive Proofs. LFCS 2022: 143-155 - Yanhong A. Liu, Scott D. Stoller:
Recursive Rules with Aggregation: A Simple Unified Semantics. LFCS 2022: 156-179 - Sérgio Marcelino
, Carlos Caleiro
, Pedro Filipe
:
Computational Properties of Partial Non-deterministic Matrices and Their Logics. LFCS 2022: 180-197 - Eoin Moore
:
Soundness and Completeness Results for LEA and Probability Semantics. LFCS 2022: 198-216 - Shota Motoura
, Shin-ya Katsumata
:
On Inverse Operators in Dynamic Epistemic Logic. LFCS 2022: 217-235 - Dag Normann, Sam Sanders:
Betwixt Turing and Kleene. LFCS 2022: 236-252 - Iosif Petrakis
:
Computability Models over Categories and Presheaves. LFCS 2022: 253-265 - Daniel Rogozin
:
Reducts of Relation Algebras: The Aspects of Axiomatisability and Finite Representability. LFCS 2022: 266-280 - Sam Sanders:
Between Turing and Kleene. LFCS 2022: 281-300 - Igor Sedlár
:
Propositional Dynamic Logic with Quantification over Regular Computation Sequences. LFCS 2022: 301-315 - Rick Statman:
Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic. LFCS 2022: 316-326 - K. Subramani, Piotr Wojciechowski:
Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems. LFCS 2022: 327-345 - Davide Trotta
, Matteo Spadetto
, Valeria de Paiva
:
Dialectica Logical Principles. LFCS 2022: 346-363 - Maciej Zielenkiewicz:
Small Model Property Reflects in Games and Automata. LFCS 2022: 364-375 - Sergei N. Artëmov
, Anil Nerode:
Logical Foundations of Computer Science - International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022, Proceedings. Lecture Notes in Computer Science 13137, Springer 2022, ISBN 978-3-030-93099-8 [contents] - 2020
- Yannick Forster
, Dominik Kirst
, Dominik Wehr
:
Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory. LFCS 2020: 47-74 - Yasir Mahmood
, Arne Meier
, Johannes Schmidt
:
Parameterised Complexity of Abduction in Schaefer's Framework. LFCS 2020: 195-213 - Nathanael L. Ackerman, Cameron E. Freer, Rehana Patel:
Computability of Algebraic and Definable Closure. LFCS 2020: 1-11 - Sergei N. Artëmov
:
Observable Models. LFCS 2020: 12-26 - Matthias Baaz
, Anela Lolic
:
A Globally Sound Analytic Calculus for Henkin Quantifiers. LFCS 2020: 128-143 - Tiziano Dalmonte
, Björn Lellmann
, Nicola Olivetti
, Elaine Pimentel
:
Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics. LFCS 2020: 27-46
skipping 287 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-06 19:26 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