Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/aml/aml24.bht:"
@article{DBLP:journals/aml/Bencivenga84, author = {Ermanno Bencivenga}, title = {A possibility-free logic of descriptions}, journal = {Arch. Math. Log.}, volume = {24}, number = {1}, pages = {159--165}, year = {1984}, url = {https://doi.org/10.1007/BF02007147}, doi = {10.1007/BF02007147}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aml/Bencivenga84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/Brunner84, author = {Norbert Brunner}, title = {Amorphe Potenzen kompakter R{\"{a}}ume}, journal = {Arch. Math. Log.}, volume = {24}, number = {1}, pages = {119--135}, year = {1984}, url = {https://doi.org/10.1007/BF02007144}, doi = {10.1007/BF02007144}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/aml/Brunner84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/Bunder84, author = {Martin W. Bunder}, title = {Category theory based on combinatory logic}, journal = {Arch. Math. Log.}, volume = {24}, number = {1}, pages = {1--16}, year = {1984}, url = {https://doi.org/10.1007/BF02007137}, doi = {10.1007/BF02007137}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aml/Bunder84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/Chong84, author = {C. T. Chong}, title = {Minimal\emph{{\(\alpha\)}}-hyperdegrees}, journal = {Arch. Math. Log.}, volume = {24}, number = {1}, pages = {63--71}, year = {1984}, url = {https://doi.org/10.1007/BF02007141}, doi = {10.1007/BF02007141}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aml/Chong84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/Drago84, author = {Antonino Drago}, title = {Constructive analysis and thermodynamics formulations}, journal = {Arch. Math. Log.}, volume = {24}, number = {1}, pages = {17--21}, year = {1984}, url = {https://doi.org/10.1007/BF02007138}, doi = {10.1007/BF02007138}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aml/Drago84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/Ferbus84, author = {Marie{-}Christine Ferbus}, title = {Functorial bounds for cut elimination in\emph{L}\({}_{\mbox{\emph{{\(\beta\)}{\(\omega\)}}}}\). {I}}, journal = {Arch. Math. Log.}, volume = {24}, number = {1}, pages = {141--158}, year = {1984}, url = {https://doi.org/10.1007/BF02007146}, doi = {10.1007/BF02007146}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aml/Ferbus84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/Friedrich84, author = {Wolfgang Friedrich}, title = {Spielquantorinterpretation unstetiger Funktionale der h{\"{o}}heren Analysis}, journal = {Arch. Math. Log.}, volume = {24}, number = {1}, pages = {73--99}, year = {1984}, url = {https://doi.org/10.1007/BF02007142}, doi = {10.1007/BF02007142}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aml/Friedrich84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/GirardV84, author = {Jean{-}Yves Girard and Jacqueline Vauzeilles}, title = {Les premiers recursivement inaccessible et Mahlo et la theorie des dilatateurs}, journal = {Arch. Math. Log.}, volume = {24}, number = {1}, pages = {167--191}, year = {1984}, url = {https://doi.org/10.1007/BF02007148}, doi = {10.1007/BF02007148}, timestamp = {Sat, 30 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/aml/GirardV84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/Jager84, author = {Gerhard J{\"{a}}ger}, title = {\emph{{\(\varrho\)}}-inaccessible ordinals, collapsing functions and a recursive notation system}, journal = {Arch. Math. Log.}, volume = {24}, number = {1}, pages = {49--62}, year = {1984}, url = {https://doi.org/10.1007/BF02007140}, doi = {10.1007/BF02007140}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aml/Jager84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/Kutschera84, author = {Franz von Kutschera}, title = {Eine Logik vager S{\"{a}}tze}, journal = {Arch. Math. Log.}, volume = {24}, number = {1}, pages = {101--118}, year = {1984}, url = {https://doi.org/10.1007/BF02007143}, doi = {10.1007/BF02007143}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aml/Kutschera84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/Mellis84, author = {Werner Mellis}, title = {Pa-Beweisbare {\(\forall\)}{\(\exists\)}-Formeln}, journal = {Arch. Math. Log.}, volume = {24}, number = {1}, pages = {23--48}, year = {1984}, url = {https://doi.org/10.1007/BF02007139}, doi = {10.1007/BF02007139}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aml/Mellis84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/Shore84, author = {Richard A. Shore}, title = {The arithmetic and Turing degrees are not elementarily equivalent}, journal = {Arch. Math. Log.}, volume = {24}, number = {1}, pages = {137--139}, year = {1984}, url = {https://doi.org/10.1007/BF02007145}, doi = {10.1007/BF02007145}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aml/Shore84.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.