Остановите войну!
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 58 matches
- 2011
- Hans Weber:
Measures and Topologies on MV-algebras. J. Log. Comput. 21(3): 527-539 (2011) - Erika Ábrahám, Tobias Schubert, Bernd Becker, Martin Fränzle, Christian Herde:
Parallel SAT Solving in Bounded Model Checking. J. Log. Comput. 21(1): 5-21 (2011) - Sergei I. Adian, Lev D. Beklemishev, Albert Visser:
Proof and Computation. J. Log. Comput. 21(4): 541-542 (2011) - Stefano Aguzzoli, Ottavio M. D'Antona, Vincenzo Marra:
Computing Minimal Axiomatizations in Gödel Propositional Logic. J. Log. Comput. 21(5): 791-812 (2011) - Stefano Aguzzoli, Brunella Gerla, Vincenzo Marra:
Applications of Topological Dualities to Measure Theory in Algebraic Many-valued Logic. J. Log. Comput. 21(3): 405-406 (2011) - Natasha Alechina, Brian Logan, Nguyen Hoang Nga, Abdur Rakib:
Logic for coalitions with bounded resources. J. Log. Comput. 21(6): 907-937 (2011) - Arnon Avron:
A Simple Proof of Completeness and Cut-admissibility for Propositional Gödel Logic. J. Log. Comput. 21(5): 813-821 (2011) - Matthias Baaz, Rosalie Iemhoff:
Eskolemization in Intuitionistic Logic. J. Log. Comput. 21(4): 625-638 (2011) - Sergey Babenyshev, Vladimir V. Rybakov:
Linear Temporal Logic LTL: Basis for Admissible Rules. J. Log. Comput. 21(2): 157-177 (2011) - Richard Banach:
Review of Modeling in Event-B: System and Sofware Engineering, 1st edition, by Jean-Raymond Abrial. J. Log. Comput. 21(2): 403-404 (2011) - Jiri Barnat, Jakub Chaloupka, Jaco van de Pol:
Distributed Algorithms for SCC Decomposition. J. Log. Comput. 21(1): 23-44 (2011) - Radim Belohlávek, Vilém Vychodil:
Codd's Relational Model from the Point of View of Fuzzy Logic. J. Log. Comput. 21(5): 851-862 (2011) - Stefan Blom, Bert Lisser, Jaco van de Pol, Michael Weber:
A Database Approach to Distributed State-Space Generation. J. Log. Comput. 21(1): 45-62 (2011) - Félix Bou, Francesc Esteva, Lluís Godo, Ricardo Oscar Rodríguez:
On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice. J. Log. Comput. 21(5): 739-790 (2011) - James Brotherston, Alex Simpson:
Sequent calculi for induction and infinite descent. J. Log. Comput. 21(6): 1177-1216 (2011) - Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin:
Two new homomorphism dualities and lattice operations. J. Log. Comput. 21(6): 1065-1092 (2011) - Ivana Cerná, Boudewijn R. Haverkort:
Parallel and Distributed Methods in Verification. J. Log. Comput. 21(1): 1-3 (2011) - Ming-Ying Chung, Gianfranco Ciardo:
Speculative Image Computation for Distributed Symbolic Reachability Analysis. J. Log. Comput. 21(1): 63-83 (2011) - Petr Cintula, George Metcalfe, Carles Noguera:
Special Issue on Mathematical Fuzzy Logic. J. Log. Comput. 21(5): 715-716 (2011) - Marcelo E. Coniglio, Amílcar Sernadas, Cristina Sernadas:
Preservation by fibring of the finite model property. J. Log. Comput. 21(2): 375-402 (2011) - Stephen Cranefield, Michael Winikoff:
Verifying social expectations by model checking truncated paths. J. Log. Comput. 21(6): 1217-1256 (2011) - Tijmen R. Daniëls:
Social choice and the logic of simple games. J. Log. Comput. 21(6): 883-906 (2011) - Evgenij Dashkov:
Arithmetical Completeness of the Intuitionistic Logic of Proofs. J. Log. Comput. 21(4): 665-682 (2011) - Catalin Dima:
Non-axiomatizability for the linear temporal logic of knowledge with concrete observability. J. Log. Comput. 21(6): 939-958 (2011) - Hans van Ditmarsch, Andreas Herzig, Tiago de Lima:
From Situation Calculus to Dynamic Epistemic Logic. J. Log. Comput. 21(2): 179-204 (2011) - Hans van Ditmarsch, Rineke Verbrugge:
The rules of the game are changing: Scientific impact factors and publication strategies among logicians. J. Log. Comput. 21(2): 121-132 (2011) - Anatolij Dvurecenskij:
On States on MV-algebras and their Applications. J. Log. Comput. 21(3): 407-427 (2011) - Jonathan Ezekiel, Gerald Lüttgen, Radu Siminiceanu:
To Parallelize or to Optimize? J. Log. Comput. 21(1): 85-120 (2011) - Tommaso Flaminio, Lluís Godo, Enrico Marchioni:
On the Logical Formalization of Possibilistic Counterparts of States over n-valued Łukasiewicz Events. J. Log. Comput. 21(3): 429-446 (2011) - Tommaso Flaminio, Franco Montagna:
Models for Many-Valued Probabilistic Reasoning. J. Log. Comput. 21(3): 447-464 (2011)
skipping 28 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-04-19 09:27 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