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 54 matches
- 2019
- John T. Baldwin, Michael C. Laskowski:
Henkin Constructions of Models with Size continuum. Bull. Symb. Log. 25(1): 1-33 (2019) - Athar Abdul-Quader:
J. H. Schmerl, Subsets coded in elementary end extensions. Archive for Mathematical Logic, vol. 53 (2014), no. 5-6, pp. 571-581. - J. H. Schmerl, Minimal elementary end extensions. Archive for Mathematical Logic, vol. 56 (2017), no. 5-6, pp. 541-553. Bull. Symb. Log. 25(1): 125-126 (2019) - Joan Bagaria, Peter Koellner, W. Hugh Woodin:
Large Cardinals beyond Choice. Bull. Symb. Log. 25(3): 283-318 (2019) - Saeideh Bahrami:
Self-embeddings of Models of Peano Arithmetic. Bull. Symb. Log. 25(2): 217-218 (2019) - Nikolay Bazhenov, Rod Downey, Iskander Sh. Kalimullin, Alexander G. Melnikov:
Foundations of Online Structure Theory. Bull. Symb. Log. 25(2): 141-181 (2019) - Marija Boricic:
Probability Sequent Calculi and Entropy Based Nonclassical Logics Classification. Bull. Symb. Log. 25(4): 446-447 (2019) - Ari Meir Brodsky:
A Theory of Stationary Trees and the Balanced Baumgartner-Hajnal-Todorcevic Theorem for Trees. Bull. Symb. Log. 25(2): 219 (2019) - Davide Catta:
N. Francez, Proof-theoretic semantics, Studies in Logic, vol. 57 College Publications, London, 2015, xx + 415 pp. Bull. Symb. Log. 25(3): 360-362 (2019) - Filippo Cavallari:
Regular Tree Languages in the First Two Levels of the Borel Hierarchy. Bull. Symb. Log. 25(2): 221-222 (2019) - Hunter Chase, James Freitag:
Model Theory and Machine Learning. Bull. Symb. Log. 25(3): 319-332 (2019) - Roy Dyckhoff:
Indirect Proof and Inversions of Syllogisms. Bull. Symb. Log. 25(2): 196-207 (2019) - Lorenzo Galeotti:
The Theory of the Generalised Real Numbers and Other Topics in Logic. Bull. Symb. Log. 25(4): 449-450 (2019) - Jun Le Goh:
Measuring the Relative Complexity of Mathematical Constructions and Theorems. Bull. Symb. Log. 25(4): 447-448 (2019) - Paul Kindvall Gorbow:
Self-similarity in the Foundations. Bull. Symb. Log. 25(2): 216-217 (2019) - Yatir Halevi, Assaf Hasson, Franziska Jahnke:
A Conjectural Classification of strongly dependent Fields. Bull. Symb. Log. 25(2): 182-195 (2019) - Maria Hämeen-Anttila:
Nominalistic Ordinals, Recursion on Higher Types, and finitism. Bull. Symb. Log. 25(1): 101-124 (2019) - Purbita Jana:
A Study of the Interrelation between Fuzzy Topological Systems and Logics. Bull. Symb. Log. 25(4): 453-454 (2019) - Asaf Karagila:
Realizing Realizability Results with Classical Constructions. Bull. Symb. Log. 25(4): 429-445 (2019) - Lukas Daniel Klausner:
Creatures and Cardinals. Bull. Symb. Log. 25(2): 218-219 (2019) - Ansten Mørch Klev:
Eta-Rules in Martin-löF Type Theory. Bull. Symb. Log. 25(3): 333-359 (2019) - Martino Lupini:
An Invitation to Model Theory and C*-Algebras. Bull. Symb. Log. 25(1): 34-100 (2019) - Hugo Nobrega:
Games for Functions: Baire Classes, Weihrauch Degrees, Transfinite Computations, and Ranks. Bull. Symb. Log. 25(4): 451-452 (2019) - Victoria Noquez:
Vaught's Two-Cardinal Theorem and Notions of Minimality in Continuous Logic. Bull. Symb. Log. 25(2): 215-216 (2019) - Francesco Parente:
Regularity of Ultrafilters, Boolean Ultrapowers, and Keisler's Order. Bull. Symb. Log. 25(4): 454-455 (2019) - Arthur Freitas Ramos:
Explicit Computational Paths in Type Theory. Bull. Symb. Log. 25(2): 213-214 (2019) - Marcus Vinícius Midena Ramos:
Formalization of Context-Free Language Theory. Bull. Symb. Log. 25(2): 214 (2019) - William D. Simmons:
Completeness of Finite-Rank Differential Varieties. Bull. Symb. Log. 25(2): 220-221 (2019) - Sourav Tarafder:
Non-Classical Set Theories and Logics Associated With Them. Bull. Symb. Log. 25(4): 451 (2019) - Aaron Thomas-Bolduc:
New Directions for Neo-logicism. Bull. Symb. Log. 25(2): 219-220 (2019) - Douglas Ulrich:
Some Applications of Set Theory to Model Theory. Bull. Symb. Log. 25(2): 214-215 (2019)
skipping 24 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-11-21 23:31 CET 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