John N. Crossley

From MaRDI portal
Person:752666

Available identifiers

zbMath Open crossley.john-newsomeDBLP35/5551WikidataQ6227761 ScholiaQ6227761MaRDI QIDQ752666

List of research outcomes





PublicationDate of PublicationType
What is mathematical logic? An Australian odyssey2024-02-20Paper
https://portal.mardi4nfdi.de/entity/Q60419142023-05-15Paper
… and so on: Schütte on Naming Ordinals2021-12-03Paper
Logics Modulo Theories: a logical framework for multi-agent systems2019-01-08Paper
What Is a Proof?2015-04-17Paper
What Is Mathematical Logic? A Survey2015-04-17Paper
What Is the Difference Between Proofs and Programs?2015-04-17Paper
Declarative programming: a logical view2013-07-24Paper
Tiered Logic for Agents in Contexts2010-10-06Paper
https://portal.mardi4nfdi.de/entity/Q35291812008-10-20Paper
https://portal.mardi4nfdi.de/entity/Q35181852008-08-07Paper
Disjunctive Constraint Lambda Calculi2008-05-27Paper
https://portal.mardi4nfdi.de/entity/Q54779482006-06-29Paper
Adapting Proofs-as-Programs2005-09-28Paper
https://portal.mardi4nfdi.de/entity/Q47371362004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44717242004-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44608452004-03-29Paper
https://portal.mardi4nfdi.de/entity/Q44608362004-03-29Paper
https://portal.mardi4nfdi.de/entity/Q44372642003-12-08Paper
https://portal.mardi4nfdi.de/entity/Q44218682003-09-01Paper
A logic-based modelling of Prolog resolution sequences including the negation as failure rule2001-09-04Paper
https://portal.mardi4nfdi.de/entity/Q27220422001-07-11Paper
Curry-Howard terms for linear logic2001-06-13Paper
Fred: An approach to generating real, correct, reusable programs from proofs2001-05-13Paper
https://portal.mardi4nfdi.de/entity/Q49419392000-10-25Paper
https://portal.mardi4nfdi.de/entity/Q47008041999-11-08Paper
New Curry-Howard terms for full linear logic1998-07-22Paper
https://portal.mardi4nfdi.de/entity/Q43854541998-07-20Paper
https://portal.mardi4nfdi.de/entity/Q43970411998-06-25Paper
https://portal.mardi4nfdi.de/entity/Q56897391997-01-07Paper
https://portal.mardi4nfdi.de/entity/Q48569501996-10-08Paper
https://portal.mardi4nfdi.de/entity/Q47640971995-11-09Paper
https://portal.mardi4nfdi.de/entity/Q47641041995-09-18Paper
https://portal.mardi4nfdi.de/entity/Q40403221993-06-05Paper
https://portal.mardi4nfdi.de/entity/Q40353061993-05-18Paper
Cancellation laws for polynomial-time \(p\)-isolated sets1992-09-27Paper
Thus spake al-Ḵẖwārizmī: A translation of the text of Cambridge University library ms. ii.vi.51990-01-01Paper
Completeness proofs for propositional logic with polynomial-time connectives1989-01-01Paper
Fifty years of computability1988-01-01Paper
Natural well-orderings1986-01-01Paper
Recursive categoricity and recursive stability1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36761361984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33463001983-01-01Paper
The given1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39265671981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39196651981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39181011981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39045851980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39241391980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41707021978-01-01Paper
Effective dimension1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41030661976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40871581975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40712231975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47690501974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47772501974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56638201972-01-01Paper
Recursive Equivalence1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55755591969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55651031968-01-01Paper
Constructive order types, III1966-01-01Paper
Constructive order types, II1966-01-01Paper
Non-uniqueness at ω2 in Kleene'sO1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55214821965-01-01Paper

Research outcomes over time

This page was built for person: John N. Crossley