![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 2,648 matches
- 2021
- Patricia A. Blanchette, Curtis Franks, Timothy Bays:
Introduction. Notre Dame J. Formal Log. 62(1) (2021) - Chris J. Conidis:
The Complexity of Module Radicals. Notre Dame J. Formal Log. 62(2) (2021) - Philip Dittmann
, Arno Fehm:
Nondefinability of Rings of Integers in Most Algebraic Fields. Notre Dame J. Formal Log. 62(3) (2021) - Damir D. Dzhafarov, Stephen Flood, Reed Solomon, Linda Brown Westrick:
Effectiveness for the Dual Ramsey Theorem. Notre Dame J. Formal Log. 62(3) (2021) - Pantelis E. Eleftheriou, Omar León Sánchez, Nathalie Regnault:
On Coincidence of Dimensions in Closed Ordered Differential Fields. Notre Dame J. Formal Log. 62(2) (2021) - Jie Fan:
Two Variants of Noncontingency Operator. Notre Dame J. Formal Log. 62(3) (2021) - Gabriel Fernandes, Ralf Schindler:
Tall Cardinals in Extender Models. Notre Dame J. Formal Log. 62(3) (2021) - Andreas Fjellstad, Jan-Fredrik Olsen:
IKTω and Łukasiewicz-Models. Notre Dame J. Formal Log. 62(2) (2021) - Iris van der Giessen, Rosalie Iemhoff
:
Sequent Calculi for Intuitionistic Gödel-Löb Logic. Notre Dame J. Formal Log. 62(2) (2021) - David R. Gilbert, Giorgio Venturi:
Reflexive-Insensitive Logics, the Boxdot Translation, and the Modal Logic of Generic Absoluteness. Notre Dame J. Formal Log. 62(2) (2021) - Stefano Guerrini, Andrea Masini:
Proof Nets for Classical Logic. Notre Dame J. Formal Log. 62(2) (2021) - Emmylou Haffner:
The Shaping of Dedekind's Rigorous Mathematics: What Do Dedekind's Drafts Tell Us about His Ideal of Rigor? Notre Dame J. Formal Log. 62(1) (2021) - Jiaqi He, Hu Liu:
A Probabilistic Semantics for Belief Logic. Notre Dame J. Formal Log. 62(4) (2021) - Graham Leach-Krouse:
Coalgebra and Abstraction. Notre Dame J. Formal Log. 62(1) (2021) - Ellen Lehet:
Impurity in Contemporary Mathematics. Notre Dame J. Formal Log. 62(1) (2021) - Timothy McCarthy:
Induction, Constructivity, and Grounding. Notre Dame J. Formal Log. 62(1) (2021) - Andrew Joseph McCarthy:
Modal Metatheory for Quantified Modal Logic, With and Without the Barcan Formulas. Notre Dame J. Formal Log. 62(2) (2021) - Joan Rand Moschovakis:
Solovay's Relative Consistency Proof for FIM and BI. Notre Dame J. Formal Log. 62(4) (2021) - Carlo Nicolai
:
Cut Elimination for Systems of Transparent Truth with Restricted Initial Sequents. Notre Dame J. Formal Log. 62(4) (2021) - Sergi Oms
, Elia Zardini
:
Inclosure and Intolerance. Notre Dame J. Formal Log. 62(2) (2021) - Anand Pillay:
Remarks on Purity of Methods. Notre Dame J. Formal Log. 62(1) (2021) - Christopher P. Porter:
Revisiting Chaitin's Incompleteness Theorem. Notre Dame J. Formal Log. 62(1) (2021) - Bruno Da Ré
:
Structural Weakening and Paradoxes. Notre Dame J. Formal Log. 62(2) (2021) - Edoardo Rivello
:
Generalizing Montague's Theorem on Recursive Definitions. Notre Dame J. Formal Log. 62(3) (2021) - Stewart Shapiro, Craige Roberts:
Open Texture and Mathematics. Notre Dame J. Formal Log. 62(1) (2021) - Guozhen Shen
:
A Choice-Free Cardinal Equality. Notre Dame J. Formal Log. 62(3) (2021) - Saronsad Sokantika, Athipat Thamrongthanyalak
:
Definable Continuous Solutions of Linear Equations. Notre Dame J. Formal Log. 62(2) (2021) - Shawn Standefer
:
An Incompleteness Theorem for Modal Relevant Logics. Notre Dame J. Formal Log. 62(4) (2021) - Damián Enrique Szmuc, Thomas Macaulay Ferguson:
Meaningless Divisions. Notre Dame J. Formal Log. 62(3) (2021) - Paul Anh Tran-Hoang:
On the Virtue of Categoricity. Notre Dame J. Formal Log. 62(1) (2021)
skipping 2,618 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.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-19 04:47 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