<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-08-21T18:34:57Z</responseDate>
  <request identifier="27397" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:27397</identifier>
        <datestamp>2026-08-21T14:42:38Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Bilateralism with Incompatible Proofs and Refutations</dc:title>
          <dc:creator>Barroso-Nascimento, Victor</dc:creator>
          <dc:creator>Osório, Maria</dc:creator>
          <dc:creator>Pimentel, Elaine</dc:creator>
          <dc:subject>Proofs and refutations</dc:subject>
          <dc:subject>Constructive falsity</dc:subject>
          <dc:subject>Natural deduction</dc:subject>
          <dc:subject>Logical bilateralism</dc:subject>
          <dc:subject>Base-extension semantics</dc:subject>
          <dc:description>Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit intuitionistic interpretations. This paper presents a bilateral system where a formula cannot be both provable and refutable without contradiction, offering a framework for modelling mathematical proofs and refutations that exclude inconsistency. We formalise the logic via a bilateral natural deduction system with the desirable proof-theoretic properties of normalisation, subformula property and consistency, together with a base-extension semantics grounded in explicit proofs and refutations. Finally, refutation is shown to coincide with Nelson’s constructive falsity, extending intuitionistic logic for constructive epistemic reasoning.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Victor Barroso-Nascimento and Maria Osório and Elaine Pimentel</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 386, 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.MFCS.2026.16</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-273974</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2026.16</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
