• 沒有找到結果。

ContentsPreface 1

N/A
N/A
Info
下載
Protected

Academic year: 2022

Share "ContentsPreface 1"

Copied!
1
0
0

加載中.... (立即查看全文)

立即下載 ( 1 頁 )

全文

(1)

ANNALS OF PURE AND APPLIED LOGIC

Volume 1 1 4 , Numbers 1-3, 1 5 April 2002

Special Issue

Commemorative Symposium Dedicated to Anne S. Troelstra on the occasion of his 60th birthday

Guest-editors

Jaap van Oosten Harold Schellinx

Contents

Preface 1

U. Berger, W. Buchholz and H. Schwichtenberg

Refined program extraction from classical proofs 3 J. Oilier

Logical problems of functional interpretations 27 J.M.E. Hyland

Proof theory in the abstract 43 G. Jager and T. Studer

Extending the system To of explicit mathematics: the limit and Mahio

axioms 79 U. Kohlenbach

On uniform weak Konig's lemma 103 D. Leivant

Intrinsic reasoning about functional programs I: first order theories 1 1 7 /. Moerdijk and E. Palmgren

Type theories, toposes and constructive set theory: predicative aspects

of AST 155 J.R. Moschovakis

Analyzing realizability by Troelstra's methods 203 A. Visser

Substitutions of ^-sentences: explorations between intuitionistic

prepositional logic and intuitionistic arithmetic 227 Author Index 273

參考文獻

立即下載 ( PDF - 1 頁 - 15.14 KB )

相關文件

Some Basic Notations Of Set Theory

Remark: Compare with Exercise 2.19, and the set of all intervals of positive length is uncountable is clear by considering {(0, x) : 0 < x <

Theory of Computation

Problem 4 (20 points) Define IP ∗ as IP except that the prover now runs in deter- ministic polynomial space instead of exponential time.. To prove the claim, we will describe

Computing Theory of

Makowsky, Linear Time Solvable Optimization Problems.

二、申請補助經費： （一）請將本計畫申請書之第四項

The classification theory of varieties usually reduced to the study of varieties of the following three types: varieties of general type, varieties with Kodaira dimension zero

Lecture 1: Set Theory

The fist step in this endeavor is to identify the possible outcomes or, in statistical terminology, the sample space.. Definition 1.1 The set, S, of all possible outcomes of

Algorithmic Aspects of Domination in Graphs

Breu and Kirk- patrick [35] (see [4]) improved this by giving O(nm 2 )-time algorithms for the domination and the total domination problems and an O(n 2.376 )-time algorithm for

Bond Theory, and

Step 3 Determine the number of bonding groups and the number of lone pairs around the central atom.. These should sum to your result from

Physics aspects of D-branes from matrix-type noncommutative geometry on D-brane world-volume

To have a good mathematical theory of D-string world-sheet instantons, we want our moduli stack of stable morphisms from Azumaya nodal curves with a fundamental module to Y to