<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>01716766</id>
  <dt>j</dt>
  <an>01716766</an>
  <augroup>
    <au>Montagna, Franco</au>
    <au>Pinna, G.Michele</au>
    <au>Tiezzi, Elisa B.P.</au>
  </augroup>
  <ti>Investigation on fragments of first order branching temporal logic.</ti>
  <so>Math. Log. Q. 48, No.1, 51-62 (2002).</so>
  <py>2002</py>
  <pu>Wiley-VCH, Berlin</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>first-order branching temporal logic</ut>
    <ut>axiomatization</ut>
    <ut>FOCTL</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1002/1521-3870(200201)48:1<51::AID-MALQ51>3.0.CO;2-S</li>
  </ligroup>
  <abgroup>
    <ab>Various fragments of first-order computational tree logic ({\bf FOCTL}) are investigated. The fragment of the logic with only the operator {\bf F} (sometimes in the future) is not axiomatizable. This is shown by a possible embedding of arithmetic into it. The proof can be extended to first-order linear time logic. It is also proved that the logic with the past operator {\bf H} (always in the past) is not axiomatizable as well. The proof is done by showing that the set of valid formulae of $\text{\bf FOCTL}_{\bold H}$ is $\Pi^0_2$-complete. The only axiomatizable fragment is the one with the next operator ({\bf X}).</ab>
    <rv>Damas Gruska (Bratislava)</rv>
  </abgroup>
</item>