Symbioses between mathematical logic and computer science

Annals of Pure and Applied Logic 167 (10):868-878 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2014.04.018

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,225

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Andreas Blass. Selective ultrafilters and homogeneity. Annals of pure and applied logic, vol. 38 , pp. 215–255. - Claude Laflamme. Forcing with filters and complete combinatorics. Annals of pure and applied logic, vol. 42 , pp. 125–163. [REVIEW]Peter J. Nyikos - 1991 - Journal of Symbolic Logic 56 (4):1490-1492.
Andreas Blass and Saharon Shelah. Ultrafilters with small generating sets. Israel journal of mathematics, vol. 65 , pp. 259–271. - Andreas Blass and Saharon Shelah. There may be simple - and -points and the Rudin–Keisler ordering may be downward directed. Annals of pure and applied logic, vol. 33 , pp. 213–243. - Andreas Blass. Near coherence of filters. II: Applications to operator ideals, the Stone–Čech remainder of a half-line, order ideals of sequences, and the slenderness of groups. Transactions of the American Mathematical Society, vol. 300 , pp. 557–581. - Andreas Blass and Saharon Shelah. Near coherence of filters III: a simplified consistency proof. Notre Dame journal of formal logic, vol. 30 , pp. 530–538. - Andreas Blass and Claude Laflamme. Consistency results about filters and the number of inequivalent growth types. The journal of symbolic logic, vol. 54 , pp. 50–56. - Andreas Blass. Applications of superperfect forcing and its relatives. Set theory and its applications. [REVIEW]Peter J. Nyikos - 1992 - Journal of Symbolic Logic 57 (2):763-766.
BLASS. A., A game semantics for linear logic CENZER, D. and REMMEL, J., Polynomial-time Abehan groups CLOTE, P. and TAKEUTI, G., Bounded arithmetic for NC, ALogTIME, L and NL. [REVIEW]P. Lincoln, J. Mitchell & A. Scedrov - 1992 - Annals of Pure and Applied Logic 56:365.
Andreas Weiermann. Sometimes slow growing is fast growing. Annals of pure and applied logic, vol. 90 (1997) pp. 91–99.Martin Ruckert - 2000 - Bulletin of Symbolic Logic 6 (2):222-223.
ASH, CJ, Stability of recursive structures in arithmetical degrees BLASS, A. and GUREVICH, Y., Henkin quantifiers and complete problems BUCHHOLZ, W., A new system of proof-theoretic ordinal functions. [REVIEW]H. Friedman & Rc Flagg - 1986 - Annals of Pure and Applied Logic 32 (C):299.
Reverse mathematical bounds for the Termination Theorem.Silvia Steila & Keita Yokoyama - 2016 - Annals of Pure and Applied Logic 167 (12):1213-1241.
Andrew M. Pitts. Interpolation and conceptual completeness for pretoposes via category theory. Mathematical logic and theoretical computer science, edited by Kueker David W., Lopez-Escobar Edgar G. K. and Smith Carl H., Lecture notes in pure and applied mathematics, vol. 106, Marcel Dekker, New York and Basel1987, pp. 301–327. - Andrew M. Pitts. Conceptual completeness for first-order intuitionistic logic: an application of categorical logic. Annals of pure and applied logic, vol. 41 , pp. 33–81. [REVIEW]Marek Zawadowski - 1995 - Journal of Symbolic Logic 60 (2):692-694.
Annals of pure and applied logic.Ja Makowsky - forthcoming - Annals of Pure and Applied Logic.
Logical form, mathematical practice, and Frege's Begriffsschrift.Danielle Macbeth - 2018 - Annals of Pure and Applied Logic 169 (12):1419-1436.
Introducing article numbering to Annals of Pure and Applied Logic.Giovanni Raneri - 2019 - Annals of Pure and Applied Logic 170 (11):102728.

Analytics

Added to PP
2016-06-30

Downloads
22 (#971,181)

6 months
7 (#704,497)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

A note on the entscheidungsproblem.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (1):40-41.
Fixed-point extensions of first-order logic.Yuri Gurevich & Saharon Shelah - 1986 - Annals of Pure and Applied Logic 32:265-280.
Choiceless polynomial time.Andreas Blass, Yuri Gurevich & Saharon Shelah - 1999 - Annals of Pure and Applied Logic 100 (1-3):141-187.
Fixed point logics.Anuj Dawar & Yuri Gurevich - 2002 - Bulletin of Symbolic Logic 8 (1):65-88.

View all 9 references / Add more references