default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeremy E. Dawson
Person information
- affiliation: Australian National University, Research School of Computer Science, Canberra, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c23]Caitlin D'Abrera
, Jeremy E. Dawson, Rajeev Goré:
A Formally Verified Cut-Elimination Procedure for Linear Nested Sequents for Tense Logic. TABLEAUX 2021: 281-298
2010 – 2019
- 2018
- [c22]Jeremy E. Dawson, Nachum Dershowitz, Rajeev Goré:
Well-Founded Unions. IJCAR 2018: 117-133 - 2017
- [c21]Jeremy E. Dawson, Rajeev Goré:
Issues in Machine-Checking the Decidability of Implicational Ticket Entailment. TABLEAUX 2017: 347-363 - 2016
- [c20]Jeremy E. Dawson, James Brotherston, Rajeev Goré:
Machine-Checked Interpolation Theorems for Substructural Logics Using Display Calculi. IJCAR 2016: 452-468 - 2015
- [c19]Jeremy E. Dawson, Rajeev Goré, Thomas Meumann:
Machine-Checked Reasoning About Complex Voting Schemes Using Higher-Order Logic. VoteID 2015: 142-158 - 2014
- [c18]Jeremy E. Dawson, Ranald Clouston, Rajeev Goré, Alwen Tiu:
From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic. IFIP TCS 2014: 250-264 - 2013
- [c17]Ranald Clouston, Jeremy E. Dawson, Rajeev Goré, Alwen Tiu:
Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic. CSL 2013: 197-214 - [i1]Ranald Clouston, Jeremy E. Dawson, Rajeev Goré, Alwen Tiu:
Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic - Extended Version. CoRR abs/1307.0289 (2013) - 2010
- [j12]Alwen Tiu, Rajeev Goré, Jeremy E. Dawson:
A Proof Theoretic Analysis of Intruder Theories. Log. Methods Comput. Sci. 6(3) (2010) - [c16]Alwen Tiu, Jeremy E. Dawson:
Automating Open Bisimulation Checking for the Spi Calculus. CSF 2010: 307-321 - [c15]Jeremy E. Dawson, Rajeev Goré:
Generic Methods for Formalising Sequent Calculi Applied to Provability Logic. LPAR (Yogyakarta) 2010: 263-277
2000 – 2009
- 2009
- [j11]Jeremy E. Dawson, Rajeev Goré:
Termination of Abstract Reduction Systems. Int. J. Found. Comput. Sci. 20(1): 57-82 (2009) - [c14]Jeremy E. Dawson, Alwen Tiu:
Formalising Observer Theory for Environment-Sensitive Bisimulation. TPHOLs 2009: 180-195 - 2007
- [c13]Jeremy E. Dawson, Rajeev Goré:
Termination of Abstract Reduction Systems. CATS 2007: 35-43 - [c12]Jeremy E. Dawson:
Compound monads in specification languages. PLPV 2007: 3-10 - [c11]Jeremy E. Dawson:
Formalising Generalised Substitutions. TPHOLs 2007: 54-69 - [c10]Jeremy E. Dawson:
Isabelle Theories for Machine Words. AVoCS 2007: 55-70 - 2004
- [c9]Jeremy E. Dawson, Rajeev Goré:
A General Theorem on Termination of Rewriting. CSL 2004: 100-114 - [c8]Jeremy E. Dawson:
Formalising General Correctness. CATS 2004: 21-42 - 2003
- [c7]Jeremy E. Dawson, Rajeev Goré:
A New Machine-checked Proof of Strong Normalisation for Display Logic. CATS 2003: 20-39 - 2002
- [c6]Jeremy E. Dawson, Rajeev Goré:
Machine-Checking the Timed Interval Calculus. Australian Joint Conference on Artificial Intelligence 2002: 95-106 - [c5]Jeremy E. Dawson, Rajeev Goré:
Formalised Cut Admissibility for Display Logic. TPHOLs 2002: 131-147 - 2001
- [c4]Jeremy E. Dawson, Rajeev Goré:
Embedding Display Calculi into Logical Frameworks: Comparing Twelf and Isabelle. CATS 2001: 89-103 - 2000
- [j10]James C. Owings Jr., Jeremy E. Dawson, Robin J. Chapman, Darryl K. Nester, Robert A. Agnew, John Beebee, David Callan, R. Garcia-Pelayo, V. Hernandez, J. Martin, J. Hickman, D. Jones, S. S. Kim, Olaf Krafft, Martin Schaefer, G. Letac, John H. Lindsey II, O. P. Lossers, K. Poelladennou, K. Schilling, M. Shemesh:
A Sum of Chebyshev Inequalities: 10687. Am. Math. Mon. 107(3): 282-283 (2000) - [j9]Harm Derksen, Jeremy E. Dawson:
A Characterization of Min or Max: 10677. Am. Math. Mon. 107(7): 654-655 (2000) - [j8]William G. Spohn Jr., Jeremy E. Dawson:
Neighborly Pythagorean Triples: 10704. Am. Math. Mon. 107(9): 865-866 (2000)
1990 – 1999
- 1999
- [c3]Jeremy E. Dawson, Peter E. Strazdins:
Optimizing User-Level Communication Patterns on the Fujitsu AP3000. IWCC 1999: 105-111 - 1998
- [c2]Jeremy E. Dawson, Rajeev Goré:
A Mechanisation of Classical Modal Tense Logics Using Isabelle. Australian Joint Conference on Artificial Intelligence 1998: 107-118 - [c1]Jeremy E. Dawson, Rajeev Goré:
A Mechanised Proof System for Relation Algebra using Display Logic. JELIA 1998: 264-278 - 1994
- [j7]Warwick de Launey, Jeremy E. Dawson:
An Asymptotic Result on the Existence of Generalised Hadamard Matrices. J. Comb. Theory A 65(1): 158-163 (1994) - 1992
- [j6]Warwick de Launey, Jeremy E. Dawson:
A note on the construction of GH(4tq, EA(q)) for t=1, 2. Australas. J Comb. 6: 177-186 (1992)
1980 – 1989
- 1985
- [j5]Jeremy E. Dawson:
Decomposition of binary matroids. Comb. 5(1): 1-9 (1985) - [j4]Jeremy E. Dawson:
Independence Spaces and Uniform Modules. Eur. J. Comb. 6(1): 29-36 (1985) - [j3]Jeremy E. Dawson:
Independence Structures on the Submodules of a Module. Eur. J. Comb. 6(1): 37-44 (1985) - 1984
- [j2]Jeremy E. Dawson, Jennifer Seberry, David B. Skillicorn:
The directed packing numbers DD (t, v, v), t>=;4. Comb. 4(2): 121-130 (1984)
1970 – 1979
- 1977
- [j1]Jeremy E. Dawson:
Balanced sets and circuits in a transversal space. J. Comb. Theory B 23(1): 14-23 (1977)
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-06-10 21:26 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:
