default search action
Search dblp for Publications
export results for "toc:db/journals/apal/apal123.bht:"
@article{DBLP:journals/apal/Andretta03, author = {Alessandro Andretta}, title = {Equivalence between Wadge and Lipschitz determinacy}, journal = {Ann. Pure Appl. Log.}, volume = {123}, number = {1-3}, pages = {163--192}, year = {2003}, url = {https://doi.org/10.1016/S0168-0072(03)00022-8}, doi = {10.1016/S0168-0072(03)00022-8}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/Andretta03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/BaratellaM03, author = {Stefano Baratella and Andrea Masini}, title = {A proof-theoretic investigation of a logic of positions}, journal = {Ann. Pure Appl. Log.}, volume = {123}, number = {1-3}, pages = {135--162}, year = {2003}, url = {https://doi.org/10.1016/S0168-0072(03)00021-6}, doi = {10.1016/S0168-0072(03)00021-6}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/BaratellaM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/BeckmannBP03, author = {Arnold Beckmann and Samuel R. Buss and Chris Pollett}, title = {Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 {(2003)} 197-223]}, journal = {Ann. Pure Appl. Log.}, volume = {123}, number = {1-3}, pages = {291}, year = {2003}, url = {https://doi.org/10.1016/S0168-0072(03)00039-3}, doi = {10.1016/S0168-0072(03)00039-3}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/BeckmannBP03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/EnglertLW03, author = {Burkhard Englert and Manuel Lerman and Kevin Wald}, title = {Homomorphisms and quotients of degree structures}, journal = {Ann. Pure Appl. Log.}, volume = {123}, number = {1-3}, pages = {193--233}, year = {2003}, url = {https://doi.org/10.1016/S0168-0072(03)00024-1}, doi = {10.1016/S0168-0072(03)00024-1}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/EnglertLW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/Goldblatt03, author = {Robert Goldblatt}, title = {Observational ultraproducts of polynomial coalgebras}, journal = {Ann. Pure Appl. Log.}, volume = {123}, number = {1-3}, pages = {235--290}, year = {2003}, url = {https://doi.org/10.1016/S0168-0072(03)00038-1}, doi = {10.1016/S0168-0072(03)00038-1}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/apal/Goldblatt03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/Japaridze03, author = {Giorgi Japaridze}, title = {Introduction to computability logic}, journal = {Ann. Pure Appl. Log.}, volume = {123}, number = {1-3}, pages = {1--99}, year = {2003}, url = {https://doi.org/10.1016/S0168-0072(03)00023-X}, doi = {10.1016/S0168-0072(03)00023-X}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/Japaridze03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/Vaisanen03, author = {Pauli V{\"{a}}is{\"{a}}nen}, title = {Almost free groups and long Ehrenfeucht-Fra{\"{\i}}ss{\'{e}} games}, journal = {Ann. Pure Appl. Log.}, volume = {123}, number = {1-3}, pages = {101--134}, year = {2003}, url = {https://doi.org/10.1016/S0168-0072(02)00063-5}, doi = {10.1016/S0168-0072(02)00063-5}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/Vaisanen03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.