<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462022000200787</article-id>
<article-id pub-id-type="doi">10.13053/cys-26-2-4238</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A Dual-Context Sequent Calculus for 																					S														4											 Modal Lambda-Term Synthesis]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Miranda-Perea]]></surname>
<given-names><![CDATA[Favio E.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Omańa Silva]]></surname>
<given-names><![CDATA[Sammantha]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[González Huesca]]></surname>
<given-names><![CDATA[Lourdes del Carmen]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Nacional Autónoma de México Facultad de Ciencias Departamento de Matemáticas]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Nacional Autónoma de México Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2022</year>
</pub-date>
<volume>26</volume>
<numero>2</numero>
<fpage>787</fpage>
<lpage>799</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462022000200787&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462022000200787&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462022000200787&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: In type-based program synthesis, the search of inhabitants in typed calculi can be seen as a process where a specification, given by a type  A, is considered to be fulfilled if we can construct a  &#955;-term  M such that   M : A, or more precisely if   &#915; &#8866; M : A holds, that is, if under some suitable assumptions  &#915; the term  M inhabits the type  A. In this paper, we tackle this inhabitation/synthesis problem for the case of modal types in the necessity fragment of the constructive logic    S 4. Our approach is human-driven in the sense of the usual reasoning procedures of modern theorem provers. To this purpose we employ a so-called dual-context sequent calculus, where the sequents have two contexts, originally proposed to capture the notions of global and local truths without resorting to any formal semantics. The use of dual-contexts allows us to define a sequent calculus which, in comparison to other related systems for the same modal logic, exhibits simpler typing inference rules for the  &#9633; operator. In several cases, the task of searching for a term having subterms with modal types is reduced to the quest for a term containing only subterms typed by non modal propositions.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Dual-context sequent calculus]]></kwd>
<kwd lng="en"><![CDATA[constructive necessity]]></kwd>
<kwd lng="en"><![CDATA[type inhabitation]]></kwd>
<kwd lng="en"><![CDATA[modal lambda calculus]]></kwd>
<kwd lng="en"><![CDATA[program synthesis]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Andrikonis]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Loop-free calculus for modal logic s4. i]]></article-title>
<source><![CDATA[Lithuanian Mathematical Journal]]></source>
<year>2012</year>
<volume>52</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-12</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Avron]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Honsell]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Miculan]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Paravano]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Encoding Modal Logics in Logical Frameworks]]></article-title>
<source><![CDATA[Studia Logica]]></source>
<year>1998</year>
<volume>60</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>161-208</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Barber]]></surname>
<given-names><![CDATA[A. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Plotkin]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Dual intuitionistic linear logic]]></source>
<year>1997</year>
<publisher-name><![CDATA[University of Edinburgh]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Basin]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Deville]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Flener]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Hamfelt]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Fischer Nilsson]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Synthesis of programs in computational logic]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Bruynooghe]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Lau]]></surname>
<given-names><![CDATA[K.-K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development]]></source>
<year>2004</year>
<page-range>30-65</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bessai]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Dudenhefner]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Düdder]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[T.-C.]]></given-names>
</name>
<name>
<surname><![CDATA[de&#8217;Liguoro]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Rehof]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Altenkirch]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[Mixin Composition Synthesis Based on Intersection Types]]></source>
<year>2015</year>
<volume>38</volume>
<conf-name><![CDATA[ 13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>76-91</page-range><publisher-loc><![CDATA[Dagstuhl, Germany ]]></publisher-loc>
<publisher-name><![CDATA[Schloss Dagstuhl&#8211;Leibniz-Zentrum fuer Informatik]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Borghuis]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Feijs]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A constructive logic for services and information flow in computer networks]]></article-title>
<source><![CDATA[The Computer Journal]]></source>
<year>2000</year>
<volume>43</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>274-89</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="">
<collab>The Coq Development Team</collab>
<source><![CDATA[The Coq Proof Assistant Reference Manual]]></source>
<year>2020</year>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Davies]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Pfenning]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A modal analysis of staged computation]]></article-title>
<source><![CDATA[J. ACM]]></source>
<year>2001</year>
<volume>48</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>555-604</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Düdder]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Martens]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Rehof]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Staged composition synthesis]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Shao]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[Programming Languages and Systems]]></source>
<year>2014</year>
<page-range>67-86</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fitting]]></surname>
<given-names><![CDATA[M. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Proof Methods for Modal and Intuitionistic Logics]]></source>
<year>1983</year>
<publisher-loc><![CDATA[Netherlands ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[González-Huesca]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Miranda-Perea]]></surname>
<given-names><![CDATA[F. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Linares-Arévalo]]></surname>
<given-names><![CDATA[P. S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Axiomatic and dual systems for constructive necessity, a formally verified equivalence]]></article-title>
<source><![CDATA[Journal of Applied Non-Classical Logics]]></source>
<year>2019</year>
<volume>29</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>255-87</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[González Huesca]]></surname>
<given-names><![CDATA[L. d. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Miranda-Perea]]></surname>
<given-names><![CDATA[F. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Linares-Arévalo]]></surname>
<given-names><![CDATA[P. S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Dual and Axiomatic Systems for Constructive S4, a Formally Verified Equivalence. Electronic Notes in Theoretical Computer Science]]></source>
<year>2020</year>
<volume>348</volume>
<conf-name><![CDATA[ 14th International Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2019)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>61-83</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Heilala]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Pientka]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Bidirectional decision procedures for the intuitionistic propositional modal logic is4]]></source>
<year>2007</year>
<conf-name><![CDATA[ 21st international conference on Automated Deduction: Automated Deduction, CADE-21]]></conf-name>
<conf-loc>Berlin, Heidelberg </conf-loc>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Henglein]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Rehof]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Modal intersection types, two-level languages, and staged synthesis]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Probst]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Hankin]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Hansen]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Semantics, logics, and calculi]]></source>
<year>2016</year>
<page-range>289-312</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hudelmaier]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A contraction-free sequent calculus for s4]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Wansing]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Proof Theory of Modal Logic]]></source>
<year>1996</year>
<page-range>3-15</page-range><publisher-loc><![CDATA[Netherlands ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kavvos]]></surname>
<given-names><![CDATA[G. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Dual-context calculi for modal logic]]></source>
<year>2017</year>
<conf-name><![CDATA[ 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017]]></conf-name>
<conf-date>June 20-23, 2017</conf-date>
<conf-loc>Reykjavik, Iceland </conf-loc>
<page-range>1-12</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martin-Löf]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the meanings of the logical constants and the justifications of the logical laws]]></article-title>
<source><![CDATA[Nordic J. Philos. Logic]]></source>
<year>1996</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>11-60</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mints]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Orevkov]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Tammet]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Transfer of sequent calculus strategies to resolution for s4]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Wansing]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Proof Theory of Modal Logic]]></source>
<year>1996</year>
<page-range>17-31</page-range><publisher-loc><![CDATA[Netherlands ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Miranda-Perea]]></surname>
<given-names><![CDATA[F. E.]]></given-names>
</name>
<name>
<surname><![CDATA[del Carmen González Huesca]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Linares-Arévalo]]></surname>
<given-names><![CDATA[P. S.]]></given-names>
</name>
</person-group>
<source><![CDATA[On interactive proof-search for constructive modal necessity. Electronic Notes in Theoretical Computer Science]]></source>
<year>2020</year>
<volume>354</volume>
<conf-name><![CDATA[ Eleventh and Twelfth Latin American Workshop on Logic/Languages, Algorithms and New Methods of Reasoning (LANMR)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>107-27</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Miranda-Perea]]></surname>
<given-names><![CDATA[F. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Linares-Arévalo]]></surname>
<given-names><![CDATA[P. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Aliseda-Llera]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[How to prove it in natural deduction: A tactical approach]]></article-title>
<source><![CDATA[CoRR]]></source>
<year>2015</year>
<volume>abs/1507.03678</volume>
</nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Miyamoto]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Igarashi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Sabelfeld]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[A modal foundation for secure information flow]]></source>
<year>2004</year>
<conf-name><![CDATA[ Workshop on Foundations of Computer Security]]></conf-name>
<conf-loc> </conf-loc>
<page-range>187-203</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Moody]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[S.]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Logical mobility and locality types]]></source>
<year>2004</year>
<volume>3573</volume>
<conf-name><![CDATA[ 14th International Conference on Logic Based Program Synthesis and Transformation. LOPSTR 2004]]></conf-name>
<conf-loc> </conf-loc>
<page-range>69-84</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Murphy VII]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Crary]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Harper]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Pfenning]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[A symmetric modal lambda calculus for distributed computing]]></source>
<year>2004</year>
<conf-name><![CDATA[ 19th Annual IEEE Symposium on Logic in Computer Science, LICS &#8217;04]]></conf-name>
<conf-loc>Washington, DC, USA </conf-loc>
<page-range>286-95</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pfenning]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Davies]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A judgmental reconstruction of modal logic]]></article-title>
<source><![CDATA[Mathematical Structures in Comp. Sci.]]></source>
<year>2001</year>
<volume>11</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>511-40</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pfenning]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Wong]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Brookes]]></surname>
<given-names><![CDATA[S. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Main]]></surname>
<given-names><![CDATA[M. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Melton]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Mislove]]></surname>
<given-names><![CDATA[M. W.]]></given-names>
</name>
</person-group>
<source><![CDATA[On a modal lambda calculus for S4]]></source>
<year>1995</year>
<volume>1</volume>
<conf-name><![CDATA[ Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, MFPS 1995]]></conf-name>
<conf-date>March 29 - April 1, 1995</conf-date>
<conf-loc>New Orleans, LA, USA </conf-loc>
<page-range>515-34</page-range><publisher-name><![CDATA[Elsevier]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pliu&#353;kevi&#269;ius]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Pliu&#353;kevi&#269;ien&#279;]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new method to obtain termination in backward proof search for modal logic s4]]></article-title>
<source><![CDATA[Journal of Logic and Computation]]></source>
<year>2008</year>
<volume>20</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>353-79</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Poggiolesi]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Gentzen Calculi for Modal Propositional Logic]]></source>
<year>2010</year>
<publisher-loc><![CDATA[Netherlands ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schroeder-Heister]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Implications-as-Rules vs. Implications-as-Links: An Alternative Implication-Left Schema for the Sequent Calculus]]></article-title>
<source><![CDATA[J. Philosophical Logic]]></source>
<year>2011</year>
<volume>40</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>95-101</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Stone]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Disjunction and modular goal-directed proof search]]></article-title>
<source><![CDATA[ACM Trans. Comput. Logic]]></source>
<year>2005</year>
<volume>6</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>539-77</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
