• Daneshyari
  • Topics
    • Physical Sciences and Engineering
      Life Sciences
      Health Sciences
      Social Sciences and Humanities
Physical Sciences and Engineering Mathematics Logic

Non-strictly positive fixed points for classical natural deduction

Article ID Journal Published Year Pages File Type
10118890 Annals of Pure and Applied Logic 2005 26 Pages PDF
Abstract
Finally, the relation to Parigot's strictly positive inductive definition of his set of reducibility candidates and to his notion of generalized reducibility candidates is explained.
Keywords
Saturated setλμ-calculusDisjunctionSecond-order logicStrong normalizationNatural deduction
Related Topics
Physical Sciences and Engineering Mathematics Logic
Preview
Non-strictly positive fixed points for classical natural deduction
Authors
Ralph Matthes,
Related Articles
Products of Menger spaces: A combinatorial approach
A classification of orbits admitting a unique invariant measure
Cardinal characteristics at κ   in a small u(κ)u(κ) model
Bounded stationary reflection II
Labeled sequent calculus for justification logics
Effective results on a fixed point algorithm for families of nonlinear mappings
Vaught's conjecture for quite o-minimal theories
Proof complexity of intuitionistic implicational formulas
Pseudo real closed fields, pseudo p-adically closed fields and NTP2
Essential and density topologies of continuous domains
Journal
Annals of Pure and Applied Logic
Journal: Annals of Pure and Applied Logic
Related Categories
Saturated set
λμ-calculus
Disjunction
Second-order logic
Strong normalization
Natural deduction
Algebra and Number Theory
Analysis
Applied Mathematics
Computational Mathematics
Control and Optimization
Discrete Mathematics and Combinatorics
Geometry and Topology
Logic
Mathematical Physics
Mathematics (General)
Modelling and Simulation
Numerical Analysis
Statistics and Probability
Theoretical Computer Science
Related Journals
Journal of Applied Logic
Daneshyari provides fulltext access to millions of research papers.