Остановите войну!
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 18 matches
- 2024
- Chao Yang, Zhujun Zhang:
A proof of Ollinger's conjecture: undecidability of tiling the plane with a set of 8 polyominoes. CoRR abs/2403.13472 (2024) - 2023
- Domenico Cantone, Eugenio G. Omodeo, Mattia Panettiere:
Reconciling transparency, low Δ0-complexity and axiomatic weakness in undecidability proofs. J. Log. Comput. 33(4): 738-763 (2023) - 2022
- Dale Miller, Alexandre Viel:
The undecidability of proof search when equality is a logical connective. Ann. Math. Artif. Intell. 90(5): 523-535 (2022) - 2019
- António Malheiro, Paulo Guilherme Santos:
A Note on a Unifying Proof of the Undecidability of Several Diagrammatic Properties of Term Rewriting Systems. CoRR abs/1910.09254 (2019) - 2018
- Andrej Dudenhefner, Jakob Rehof:
A Simpler Undecidability Proof for System F Inhabitation. TYPES 2018: 2:1-2:11 - 2017
- Vesa Halava, Tero Harju, Esa Sahla:
A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem. Fundam. Informaticae 154(1-4): 167-176 (2017) - 2016
- Cristian S. Calude, Declan Thompson:
Incompleteness, Undecidability and Automated Proofs - (Invited Talk). CASC 2016: 134-155 - 2014
- Vesa Halava:
Another proof of undecidability for the correspondence decision problem - Had I been Emil Post. CoRR abs/1411.5197 (2014) - 2013
- Vesa Halava, Tero Harju:
New proof for the undecidability of the circular PCP. Acta Informatica 50(5-6): 331-341 (2013) - 2010
- Li Miao, Da-Fang Zhang:
A New Proof for the Undecidability of Context-Sensitive Synchronization-Sensitive Analysis. FCST 2010: 291-296 - 2004
- Ulisses Ferreira:
On Turing's Proof of the Undecidability of the Halting Problem. MSV/AMCS 2004: 519-522 - 2003
- Pawel Urzyczyn:
A Simple Proof of the Undecidability of Strong Normalisation. Math. Struct. Comput. Sci. 13(1): 5-13 (2003) - 1996
- Marc Bezem, Jan Springintveld:
A Simple Proof of the Undecidability of Inhabitation in lambdaP. J. Funct. Program. 6(5): 757-761 (1996) - 1993
- Bruno Durand:
Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof. FCT 1993: 204-211 - 1990
- Luigi Palopoli:
A new proof of undecidability of safety of logic queries. SIGACT News 21(4): 69-72 (1990) - Ralf Treinen:
A New Method for Undecidability Proofs of First Order Theories. FSTTCS 1990: 48-62 - 1975
- Jekeri Okee:
A semantical proof of the undecidability of the monadic intuitionistic predicate calculus of the first order. Notre Dame J. Formal Log. 16(4): 552-554 (1975) - 1972
- Grzegorz Rozenberg:
Direct Proofs of the Undecidability of the Equivalence Problem for Sentential Forms of Linear Context-Free Grammars and the Equivalence Problem for 0L Systems. Inf. Process. Lett. 1(6): 233-235 (1972)
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-04-25 13: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