default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSara Negri
Person information
- affiliation: University of Genoa, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j39]Giulio Fellin, Sara Negri, Eugenio Orlandelli
:
Glivenko sequent classes and constructive cut elimination in geometric logics. Arch. Math. Log. 62(5-6): 657-688 (2023)- [j38]Matteo Tesi, Sara Negri:
The Gödel-McKinsey-Tarski embedding for infinitary intuitionistic logic and its extensions. Ann. Pure Appl. Log. 174(8): 103285 (2023) - 2021
- [j37]Marianna Girlando, Sara Negri, Nicola Olivetti:
Uniform labelled calculi for preferential conditional logics based on neighbourhood semantics. J. Log. Comput. 31(3): 947-997 (2021) - [j36]Matteo Tesi, Sara Negri:
Neighbourhood semantics and labelled calculus for intuitionistic infinitary logic. J. Log. Comput. 31(7): 1608-1639 (2021) - [j35]Sara Negri, Edi Pavlovic:
Proof-Theoretic Analysis of the Logics of Agency: The Deliberative STIT. Stud Logica 109(3): 473-507 (2021) - [j34]Sara Negri:
The intensional side of algebraic-topological representation theorems. Synth. 198(5-S): 1121-1143 (2021) - [c17]Giulio Fellin, Sara Negri, Eugenio Orlandelli:
Constructive Cut Elimination in Geometric Logic. TYPES 2021: 7:1-7:16 - [e2]Anupam Das, Sara Negri:
Automated Reasoning with Analytic Tableaux and Related Methods - 30th International Conference, TABLEAUX 2021, Birmingham, UK, September 6-9, 2021, Proceedings. Lecture Notes in Computer Science 12842, Springer 2021, ISBN 978-3-030-86058-5 [contents] - [i2]Thierry Coquand, Hajime Ishihara, Sara Negri, Peter M. Schuster:
Geometric Logic, Constructivisation, and Automated Theorem Proving (Dagstuhl Seminar 21472). Dagstuhl Reports 11(10): 151-172 (2021) - 2020
- [j33]Tiziano Dalmonte, Sara Negri, Nicola Olivetti, Gian Luca Pozzato:
Proof-search and countermodel generation for non-normal modal logics: The theorem prover PRONOM. Intelligenza Artificiale 14(2): 215-229 (2020) - [c16]Giulio Fellin, Sara Negri, Peter M. Schuster:
Modal Logic for Induction. AiML 2020: 209-227 - [c15]Tiziano Dalmonte, Sara Negri, Nicola Olivetti, Gian Luca Pozzato:
Theorem Proving for Non-normal Modal Logics. OVERLAY 2020: 17-22 - [e1]Nicola Olivetti, Rineke Verbrugge, Sara Negri, Gabriel Sandu:
13th Conference on Advances in Modal Logic, AiML 2020, Helsinki, Finland, August 24-28, 2020. College Publications 2020, ISBN 978-1-84890-341-8 [contents] - [i1]Marianna Girlando, Sara Negri, Nicola Olivetti:
Uniform labelled calculi for preferential conditional logics based on neighbourhood semantics. CoRR abs/2002.05958 (2020)
2010 – 2019
- 2019
- [j32]Sara Negri, Eugenio Orlandelli:
Proof theory for quantified monotone modal logics. Log. J. IGPL 27(4): 478-506 (2019) - [c14]Tiziano Dalmonte, Sara Negri, Nicola Olivetti, Gian Luca Pozzato:
PRONOM: Proof-Search and Countermodel Generation for Non-normal Modal Logics. AI*IA 2019: 165-179 - [c13]Marianna Girlando, Sara Negri, Giorgio Sbardolini:
Uniform Labelled Calculi for Conditional and Counterfactual Logics. WoLLIC 2019: 248-263 - 2018
- [j31]Marianna Girlando, Sara Negri, Nicola Olivetti, Vincent Risch:
Conditional Beliefs: from neighbourhood Semantics to Sequent Calculus. Rev. Symb. Log. 11(4): 736-779 (2018) - [c12]Tiziano Dalmonte, Nicola Olivetti, Sara Negri:
Non-Normal Modal Logics: Bi-Neighbourhood Semantics and Its Labelled Calculi. Advances in Modal Logic 2018: 159-178 - [c11]Marianna Girlando, Nicola Olivetti, Sara Negri:
Counterfactual Logic: Labelled and Internal Calculi, Two Sides of the Same Coin?. Advances in Modal Logic 2018: 291-310 - 2017
- [j30]Roy Dyckhoff, Sara Negri:
Commentary on Grigori Mints' "Classical and Intuitionistic Geometric Logic". FLAP 4(4) (2017) - [j29]Sara Negri:
Correction note to "Proof theory for non-normal modal logics: The neighbourhood formalism". FLAP 4(4) (2017) - [j28]Sara Negri:
Proof Theory for Non-normal Modal Logics: The Neighbourhood Formalism and Basic Results. FLAP 4(4) (2017) - 2016
- [j27]Sara Negri:
Glivenko sequent classes in the light of structural proof theory. Arch. Math. Log. 55(3-4): 461-473 (2016) - [j26]Roy Dyckhoff, Sara Negri:
A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel-McKinsey-Tarski embedding. J. Log. Comput. 26(1): 169-187 (2016) - [j25]Sara Negri:
Proof analysis beyond geometric theories: from rule systems to systems of rules. J. Log. Comput. 26(2): 513-537 (2016) - [j24]Sara Negri, Giorgio Sbardolini:
Proof Analysis for Lewis Counterfactuals. Rev. Symb. Log. 9(1): 44-75 (2016) - [c10]Marianna Girlando, Sara Negri, Nicola Olivetti, Vincent Risch:
The Logic of Conditional Beliefs: Neighbourhood Semantics and Sequent Calculus. Advances in Modal Logic 2016: 322-341 - 2015
- [j23]Roy Dyckhoff, Sara Negri:
Geometrisation of First-order Logic. Bull. Symb. Log. 21(2): 123-163 (2015) - [c9]Sara Negri, Nicola Olivetti:
A Sequent Calculus for Preferential Conditional Logic Based on Neighbourhood Semantics. TABLEAUX 2015: 115-134 - 2014
- [b2]Sara Negri, Jan von Plato:
Proof Analysis - A Contribution to Hilbert's Last Problem. Cambridge University Press 2014, ISBN 978-1-10-741723-6, pp. I-XI, 1-265 - [j22]Sara Negri:
Proofs and Countermodels in Non-Classical Logics. Logica Universalis 8(1): 25-60 (2014) - [c8]Sara Negri:
Recent Advances in Proof Systems for Modal Logic. Advances in Modal Logic 2014: 421-422 - 2013
- [j21]Paolo Maffezioli, Alberto Naibo, Sara Negri:
The Church-Fitch knowability paradox in the light of structural proof theory. Synth. 190(14): 2677-2716 (2013) - [c7]Sara Negri:
On the Duality of Proofs and Countermodels in Labelled Sequent Calculi. TABLEAUX 2013: 5-9 - 2012
- [j20]Roy Dyckhoff, Sara Negri:
Proof analysis in intermediate logics. Arch. Math. Log. 51(1-2): 71-92 (2012) - [j19]Raul Hakli, Sara Negri:
Does the deduction theorem fail for modal logic? Synth. 187(3): 849-867 (2012) - [c6]Deepak Garg, Valerio Genovese, Sara Negri:
Countermodels from Sequent Calculi in Multi-Modal Logics. LICS 2012: 315-324 - 2011
- [j18]Raul Hakli, Sara Negri:
Reasoning About Collectively Accepted Group Beliefs. J. Philos. Log. 40(4): 531-555 (2011)
2000 – 2009
- 2009
- [c5]Bianca Boretti, Sara Negri:
Decidability for Priorean Linear Time Using a Fixed-Point Labelled Calculus. TABLEAUX 2009: 108-122 - 2007
- [c4]Raul Hakli, Sara Negri:
Proof Theory for Distributed Knowledge. CLIMA 2007: 100-116 - 2006
- [j17]Roy Dyckhoff, Sara Negri:
Decision methods for linearly ordered Heyting algebras. Arch. Math. Log. 45(4): 411-422 (2006) - 2005
- [j16]Sara Negri:
Proof Analysis in Modal Logic. J. Philos. Log. 34(5-6): 507-544 (2005) - [j15]Sara Negri:
Permutability of Rules for Linear Lattices. J. Univers. Comput. Sci. 11(12): 1986-1995 (2005) - [p1]Sara Negri, Jan von Plato:
The duality of lcassical and constructive notions and proofs. From sets and types to topology and analysis 2005 - 2004
- [j14]Sara Negri, Jan von Plato, Thierry Coquand:
Proof-theoretical analysis of order relations. Arch. Math. Log. 43(3): 297-310 (2004) - [j13]Sara Negri, Jan von Plato:
Proof systems for lattice theory. Math. Struct. Comput. Sci. 14(4): 507-526 (2004) - 2003
- [j12]Sara Negri:
Contraction-free sequent calculi for geometric theories with an application to Barr's theorem. Arch. Math. Log. 42(4): 389-401 (2003) - 2002
- [j11]Sara Negri:
A normalizing system of natural deduction for intuitionistic linear logic. Arch. Math. Log. 41(8): 789-810 (2002) - [j10]Sara Negri:
Varieties of Linear Calculi. J. Philos. Log. 31(6): 569-590 (2002) - [j9]Sara Negri:
Continuous Domains as Formal Spaces. Math. Struct. Comput. Sci. 12(1): 19-52 (2002) - 2001
- [b1]Sara Negri, Jan von Plato:
Structural proof theory. Cambridge University Press 2001, ISBN 978-0-521-79307-0, pp. I-XVII, 1-257 - [j8]Roy Dyckhoff, Sara Negri:
Admissibility of Structural Rules for Extensions of Contraction-Free Sequent Calculi. Log. J. IGPL 9(4): 541-548 (2001) - [j7]Sara Negri, Jan von Plato:
Sequent Calculus in Natural Deduction Style. J. Symb. Log. 66(4): 1803-1816 (2001) - 2000
- [j6]Roy Dyckhoff, Sara Negri:
Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic. J. Symb. Log. 65(4): 1499-1518 (2000)
1990 – 1999
- 1999
- [j5]Sara Negri, Daniele Soravia:
The continuum as a formal space. Arch. Math. Log. 38(7): 423-447 (1999) - [j4]Sara Negri:
Sequent calculus proof theory of intuitionistic apartness and order relations. Arch. Math. Log. 38(8): 521-547 (1999) - 1998
- [j3]Sara Negri, Jan von Plato:
Cut elimination in the presence of axioms. Bull. Symb. Log. 4(4): 418-435 (1998) - [c3]Sara Negri, Jan von Plato:
From Kripke Models to Algebraic Counter-Valuations. TABLEAUX 1998: 247-261 - 1997
- [j2]Sara Negri, Silvio Valentini:
Tychonoff's Theorem in the Framework of Formal Topologies. J. Symb. Log. 62(4): 1315-1332 (1997) - 1996
- [c2]Sara Negri:
Continous Lattices in Formal Topology. TYPES 1996: 333-353 - 1995
- [j1]Sara Negri:
Semantical Observations on the Embedding of Intuitionistic Logic into Intuitionistic Linear Logic. Math. Struct. Comput. Sci. 5(1): 41-68 (1995) - [c1]Jan Cederquist, Sara Negri:
A Constructive Proof of the Heine-Borel Covering Theorem for Formal Reals. TYPES 1995: 62-75
Coauthor Index
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-04-24 23:09 CEST 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:
