default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNils Kürbis
Person information
- affiliation: University College London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[p1]Bernhard Weiss, Nils Kürbis
:
Molecularity in the Theory of Meaning and the Topic Neutrality of Logic. Perspectives on Deduction 2024: 187-209- [i11]Nils Kürbis:
Normalisation for Negative Free Logics without and with Definite Descriptions. CoRR abs/2410.11445 (2024) - 2023
- [c3]Andrzej Indrzejczak, Nils Kürbis:
A Cut-Free, Sound and Complete Russellian Theory of Definite Descriptions. TABLEAUX 2023: 112-130 - [i10]Nils Kürbis:
Comment on Mark Textor: Brentano's Positing Theory of Existence. CoRR abs/2304.08441 (2023) - 2022
- [j6]Nils Kürbis:
Normalisation and subformula property for a system of classical logic with Tarski's rule. Arch. Math. Log. 61(1-2): 105-129 (2022) - [j5]Nils Kürbis:
A Binary Quantifier for Definite Descriptions for Cut Free Free Logics. Stud Logica 110(1): 219-239 (2022) - [c2]Nils Kürbis:
Bilateral Inversion Principles. NCL 2022: 202-215 - 2021
- [j4]Nils Kürbis:
Normalisation for Bilateral Classical Logic with some Philosophical Remarks. FLAP 8(2): 531-556 (2021) - [j3]Nils Kürbis:
Addenda: Note on 'Normalisation for Bilateral Classical Logic with some Philosophical Remarks'. FLAP 8(7): 2257-2259 (2021) - [c1]Nils Kürbis:
Proof-Theory and Semantics for a Theory of Definite Descriptions. TABLEAUX 2021: 95-111 - [i9]Nils Kürbis:
A Sketch of a Proof-Theoretic Semantics for Necessity. CoRR abs/2107.13975 (2021) - [i8]Nils Kürbis:
Proof-Theoretic Semantics, a Problem with Negation and Prospects for Modality. CoRR abs/2107.13988 (2021) - [i7]Nils Kürbis:
A Binary Quantifier for Definite Descriptions in Intuitionist Negative Free Logic: Natural Deduction and Normalisation. CoRR abs/2108.01976 (2021) - [i6]Nils Kürbis:
Two Treatments of Definite Descriptions in Intuitionist Negative Free Logic. CoRR abs/2108.01977 (2021) - [i5]Nils Kürbis:
Definite Descriptions in Intuitionist Positive Free Logic. CoRR abs/2108.01978 (2021) - [i4]Nils Kürbis:
Normalisation and Subformula Property for a System of Classical Logic with Tarski's Rule. CoRR abs/2108.03939 (2021) - [i3]Nils Kürbis:
Proof-Theory and Semantics for a Theory of Definite Descriptions. CoRR abs/2108.03944 (2021) - [i2]Nils Kürbis:
Normalisation for Bilateral Classical Logic with some Philosophical Remarks, and a Note on it. CoRR abs/2108.05842 (2021) - [i1]Nils Kürbis:
Normalisation and subformula property for a system of intuitionistic logic with general introduction and elimination rules. CoRR abs/2110.09921 (2021)
2010 – 2019
- 2016
- [j2]Nils Kürbis:
Some Comments on Ian Rumfitt's Bilateralism. J. Philos. Log. 45(6): 623-644 (2016) - 2015
- [j1]Nils Kürbis:
Proof-Theoretic Semantics, a Problem with Negation and Prospects for Modality. J. Philos. Log. 44(6): 713-727 (2015)
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.
last updated on 2024-11-25 23:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
