Остановите войну!
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 36 matches
- 2007
- Evangelia Antonakos:
Justified and Common Knowledge: Limited Conservativity. LFCS 2007: 1-11 - Sergei N. Artëmov, Eduardo Bonelli:
The Intensional Lambda Calculus. LFCS 2007: 12-25 - Arnon Avron, Anna Zamansky:
Generalized Non-deterministic Matrices and (n, k)-ary Quantifiers. LFCS 2007: 26-40 - Howard A. Blair, David W. Jakel, Robert J. Irwin, Angel J. Rivera:
Elementary Differential Calculus on Discrete and Hybrid Structures. LFCS 2007: 41-53 - Benedikt Bollig, Ingmar Meinecke:
Weighted Distributed Systems and Their Logics. LFCS 2007: 54-68 - Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier:
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! LFCS 2007: 69-83 - Davide Bresolin, Valentin Goranko, Angelo Montanari, Guido Sciavicco:
On Decidability and Expressiveness of Propositional Interval Neighborhood Logics. LFCS 2007: 84-99 - Rémi Brochenin, Stéphane Demri, Étienne Lozes:
Reasoning About Sequences of Memory States. LFCS 2007: 100-114 - Guillaume Burel, Claude Kirchner:
Cut Elimination in Deduction Modulo by Abstract Completion. LFCS 2007: 115-131 - Agata Ciabattoni, George Metcalfe:
Density Elimination and Rational Completeness for First-Order Logics. LFCS 2007: 132-146 - Robert L. Constable, Wojciech Moczydlowski:
Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus. LFCS 2007: 147-161 - Jennifer M. Davoren:
Topological Semantics and Bisimulations for Intuitionistic Modal Logics and Their Classical Companion Logics. LFCS 2007: 162-179 - Stéphane Demri, Deepak D'Souza, Régis Gascon:
A Decidable Temporal Logic of Repeating Values. LFCS 2007: 180-194 - Kai Engelhardt, Peter Gammie, Ron van der Meyden:
Model Checking Knowledge and Linear Time: PSPACE Cases. LFCS 2007: 195-211 - Melvin Fitting:
Realizations and LP. LFCS 2007: 212-223 - Raffaella Gentilini, Klaus Schneider, Bud Mishra:
Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking. LFCS 2007: 224-240 - Evan Goris:
Explicit Proofs in Formal Provability Logic. LFCS 2007: 241-253 - Srikanth Gottipati, Anil Nerode:
A Synthesis Algorithm for Hybrid Systems. LFCS 2007: 254-268 - Bernhard Heinemann:
Including the Past in 'Topologic'. LFCS 2007: 269-283 - Max I. Kanovich:
A Note on Rewriting Proofs and Fibonacci Numbers. LFCS 2007: 284-292 - Bakhadyr Khoussainov, Jiamou Liu:
On Complexity of Ehrenfeucht-Fraïssé Games. LFCS 2007: 293-309 - Bjørn Kjos-Hanssen, Anil Nerode:
The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion. LFCS 2007: 310-317 - Hidenori Kurokawa:
Hypersequent Calculus for Intuitionistic Logic with Classical Atoms. LFCS 2007: 318-331 - Roman Kuznets:
Proof Identity for Classical Logic: Generalizing to Normality. LFCS 2007: 332-348 - Robert S. Lubarsky, Michael Rathjen:
On the Constructive Dedekind Reals: Extended Abstract. LFCS 2007: 349-362 - Zohar Manna, Henny B. Sipma, Ting Zhang:
Verifying Balanced Trees. LFCS 2007: 363-378 - Victor W. Marek, Jeffrey B. Remmel:
Compactness Properties for Stable Semantics of Logic Programs. LFCS 2007: 379-400 - Virgile Mogbil, Vincent Rahli:
Uniform Circuits, & Boolean Proof Nets. LFCS 2007: 401-421 - André Nies, Pavel Semukhin:
Finite Automata Presentable Abelian Groups. LFCS 2007: 422-436 - Michael O'Connor:
Embeddings into Free Heyting Algebras and Translations into Intuitionistic Propositional Logic. LFCS 2007: 437-448
skipping 6 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-20 18:20 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