杂志简称：ann pure appl logic
中文译名：《纯逻辑和应用逻辑年鉴》
收录属性：高质量科技期刊（t2）, scie（2024版）, 目次收录（维普）, 目次收录（知网）,英文期刊,
自引率：7.70%
投稿方向：数学、logic逻辑学、mathematics数学、mathematics, applied
应用数学
SCI/E期刊基本信息
出版周期：年10期 地区：荷兰
中科院分区：3区
是否TOP：TOP期刊
是否综述：非综述期刊
是否OA：非OA期刊
国际标准刊号：ISSN 0168-0072；E-ISSN 1873-2461
杂志语言：英语
出版国家：荷兰
杂志官网 联系方式
出版地址：RADARWEG 29,AMSTERDAM,NETHERLANDS,1043 NX
杂志邮箱：
投稿网址：https://www.editorialmanager.com/APAL
杂志官方网址：https://www.journals.elsevier.com/annals-of-pure-and-applied-logic/
出版商网址：https://www.elsevier.com/
杂志投稿要求
投稿须知【杂志社官方网站信息】
Guide for Authors
The journal Annals of Pure and Applied Logic publishes high quality papers in all areas of mathematical logic as well as applications of logic in mathematics, in theoretical computer science and in other related disciplines.
All submissions to the journal should be mathematically correct, well written (preferably in English) and contain relevant new results that are of significant interest to a substantial number of logicians.
The journal also considers submissions that are somewhat too long to be published by other journals while being too short to form a separate memoir provided that they are of particular outstanding quality and broad interest. In addition, Annals of Pure and Applied Logic occasionally publishes Special Issues of selected papers from well-chosen conferences in pure and applied logic.
Contact Details for Submission
Contributions, preferably in English, may be submitted to any Editor but it is preferred you select the Editor closest to your subject matter. If you are unsure of which Editor to use, please choose one of the Coordinating Editors. Please submit in electronic format, using TeX and preferably the macros of APAL. Final decision for publication will be taken by the handling Editor. Each paper should be introduced by a (short) self-contained abstract without long formulae.
Coordinating Editors:
Ulrich Kohlenbach
Proof Theory, Constructive Mathematics, Logic in Analysis
Email address: kohlenbach@mathematik.tu-darmstadt.de
Thomas Scanlon
Model Theory
Email address: scanlon@math.berkeley.edu
Philip Scott
Categorical Logic and Proof Theory, Linear Logic, Lambda Calculi, Modal and Many-valued Logics, Theoretical Computer Science
Email address: phil@site.uottawa.ca
Editorial Board:
Arnold Beckmann
Proof Theory, Proof Complexity, Logic in Computer Science
Email address: a.beckmann@swansea.ac.uk
Natasha Dobrinen
Set Theory
Email address: natasha.dobrinen@du.edu
J.M.E. Hyland
Categorical Logic, Lambda Calculus, Higher Type Recursion Theory, Linear Logic
Email address: martin@dpmms.cam.ac.uk
A. Nies
Computability and its ramifications, Reverse Mathematics, Complexity Theory
Email address: andre@cs.auckland.ac.nz
Keita Yokoyama
Japan Advanced Institute of Science and Technology Graduate School of Knowledge Science, Japan
Email address: y-keita@jaist.ac.jp
Upon acceptance of an article, the author(s) will be asked to transfer copyright of the article to the publisher. This transfer will ensure the widest possible dissemination of information. No page charge is made. Please note that typesetting costs of author's corrections in proof, other than the printer's errors, will be charged to the author. The manuscript should be prepared for publication in accordance with the instructions given below: