Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic

dc.contributor.authorGore, Rajeev
dc.contributor.authorPostniece (previously Buisman), Linda
dc.date.accessioned2015-12-10T22:22:16Z
dc.date.issued2008
dc.date.updated2016-02-24T11:43:50Z
dc.description.abstractBi-intuitionistic logic is the union of intuitionistic and dual intuitionistic logic, and was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent 'cut-free' sequent calculus has recently been shown to fail cut-elimination. We present a new cut-free sequent calculus for bi-intuitionistic logic, and prove it sound and complete with respect to its Kripke semantics. Ensuring completeness is complicated by the interaction between intuitionistic implication and dual intuitionistic exclusion, similarly to future and past modalities in tense logic. Our calculus handles this interaction using derivations and refutations as first class citizens. We employ extended sequents which pass information from premises to conclusions using variables instantiated at the leaves of refutations, and rules which compose certain refutations and derivations to form derivations. Automated deduction using terminating backward search is also possible, although this is not our main purpose.
dc.identifier.issn0955-792X
dc.identifier.urihttp://hdl.handle.net/1885/52605
dc.publisherOxford University Press
dc.sourceJournal of Logic and Computation
dc.subjectKeywords: Automated deduction; Cut elimination; Dual intuitionistic logic; Hilbert; Intuitionistic logic; Kripke semantics; Proof search; Sequent calculus; Differentiation (calculus); Formal logic; Semantics; Calculations Bi-intuitionistic logic; Decision procedure; Proof search; Refutation calculus; Sequent calculus
dc.titleCombining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic
dc.typeJournal article
local.bibliographicCitation.issue1
local.bibliographicCitation.lastpage260
local.bibliographicCitation.startpage233
local.contributor.affiliationGore, Rajeev, College of Engineering and Computer Science, ANU
local.contributor.affiliationPostniece (previously Buisman), Linda, College of Engineering and Computer Science, ANU
local.contributor.authoruidGore, Rajeev, u9409448
local.contributor.authoruidPostniece (previously Buisman), Linda, u4103899
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.identifier.absfor010107 - Mathematical Logic, Set Theory, Lattices and Universal Algebra
local.identifier.absfor080203 - Computational Logic and Formal Languages
local.identifier.absfor080299 - Computation Theory and Mathematics not elsewhere classified
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
local.identifier.ariespublicationu8803936xPUB250
local.identifier.citationvolume20
local.identifier.doi10.1093/logcom/exn067
local.identifier.scopusID2-s2.0-76649120845
local.identifier.thomsonID000274342600010
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
01_Gore_Combining_Derivations_and_2008.pdf
Size:
315.49 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
02_Gore_Combining_Derivations_and_2008.pdf
Size:
373.89 KB
Format:
Adobe Portable Document Format