Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/apal/apal104.bht:"
download as .bib file
@article{DBLP:journals/apal/Arai00a,
author = {Noriko H. Arai},
title = {Relative efficency of propositional proof systems: resolution vs.
cut-free {LK}},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {3--16},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00005-1},
doi = {10.1016/S0168-0072(00)00005-1},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Arai00a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BellantoniNS00,
author = {Stephen J. Bellantoni and
Karl{-}Heinz Niggl and
Helmut Schwichtenberg},
title = {Higher type recursion, ramification and polynomial time},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {17--30},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00006-3},
doi = {10.1016/S0168-0072(00)00006-3},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/BellantoniNS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Burr00,
author = {Wolfgang Burr},
title = {Functional interpretation of Aczel's constructive set theory},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {31--73},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00007-5},
doi = {10.1016/S0168-0072(00)00007-5},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Burr00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/ButzKRW00,
author = {Carsten Butz and
Ulrich Kohlenbach and
S{\o}ren Riis and
Glynn Winskel},
title = {Preface},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {1--2},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00004-X},
doi = {10.1016/S0168-0072(00)00004-X},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/ButzKRW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/FefermanS00,
author = {Solomon Feferman and
Thomas Strahm},
title = {The unfolding of non-finitist arithmetic},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {75--96},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00008-7},
doi = {10.1016/S0168-0072(00)00008-7},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/FefermanS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Hendriks00,
author = {Lex Hendriks},
title = {Doing logic b computer: interpolation in fragments ofinstuitionistic
propositional logic},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {97--112},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00009-9},
doi = {10.1016/S0168-0072(00)00009-9},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Hendriks00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Hofmann00,
author = {Martin Hofmann},
title = {Safe recursion with higher types and BCK-algebra},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {113--166},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00010-5},
doi = {10.1016/S0168-0072(00)00010-5},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Hofmann00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Mints00,
author = {Grigori Mints},
title = {Reduction of finite and infinite derivations},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {167--188},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00011-7},
doi = {10.1016/S0168-0072(00)00011-7},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Mints00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/MoerdijkP00,
author = {Ieke Moerdijk and
Erik Palmgren},
title = {Wellfounded trees in categories},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {189--218},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00012-9},
doi = {10.1016/S0168-0072(00)00012-9},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/MoerdijkP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Nivelle00,
author = {Hans de Nivelle},
title = {Deciding the E\({}^{\mbox{+}}\) - class by an a posteriori, liftable
order},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {219--232},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00013-0},
doi = {10.1016/S0168-0072(00)00013-0},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Nivelle00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/OostenS00,
author = {Jaap van Oosten and
Alex K. Simpson},
title = {Axioms and (counter) examples in synthetic domain theory},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {233--278},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00014-2},
doi = {10.1016/S0168-0072(00)00014-2},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apal/OostenS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Pollett00,
author = {Chris Pollett},
title = {Multifunction algebras and the provability of {PH}},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {279--302},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00015-4},
doi = {10.1016/S0168-0072(00)00015-4},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Pollett00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Strahm00,
author = {Thomas Strahm},
title = {The non-constructive mu operator, fixed point theories with ordinals,
and the bar rule},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {305--324},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00016-6},
doi = {10.1016/S0168-0072(00)00016-6},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Strahm00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Trevisan00,
author = {Luca Trevisan},
title = {Interactive and probabilistic proof-checking},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {325--342},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00017-8},
doi = {10.1016/S0168-0072(00)00017-8},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Trevisan00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-08-04 04:42 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
