<?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-17T16:12:38Z</responseDate>
  <request identifier="4624" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:4624</identifier>
        <datestamp>2024-03-06T10:35:09Z</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>A "Game Semantical" Intuitionistic Realizability Validating Markov's Principle</dc:title>
          <dc:creator>Aschieri, Federico</dc:creator>
          <dc:creator>Zorzi, Margherita</dc:creator>
          <dc:subject>Markov's Principle</dc:subject>
          <dc:subject>Intuitionistic Realizability</dc:subject>
          <dc:subject>Heyting Arithmetic</dc:subject>
          <dc:subject>Game Semantics</dc:subject>
          <dc:description>We propose a very simple modification of Kreisel's modified realizability in order to computationally realize Markov's Principle in the context of Heyting Arithmetic. Intuitively, realizers correspond to arbitrary strategies in Hintikka-Tarski games, while in Kreisel's realizability they can only represent winning strategies.  Our definition, however, does not employ directly game semantical concepts and remains in the style of functional interpretations.  As term calculus, we employ a purely functional language, which is Goedel's System T enriched with some syntactic sugar.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Federico Aschieri and Margherita Zorzi</dc:contributor>
          <dc:date>2014</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 26, 19th International Conference on Types for Proofs and Programs (TYPES 2013)</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.TYPES.2013.24</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-46245</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2013.24</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
