Relative Definability and Models of Unary PCF

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-44904-3_6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Random Unary Predicates: Almost Sure Theories and Countable Models

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
1998English

On Safety of Unary and Non-Unary IFP-operators

Modeling and Analysis of Information Systems
2018English

Naturality and Definability, I

Journal of the London Mathematical Society
Mathematics
1986English

Limited Automata and Unary Languages

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2019English

Definability and Almost Disjoint Families

Advances in Mathematics
Mathematics
2018English

Homomorphisms of Mono-Unary Algebras

Pacific Journal of Mathematics
Mathematics
1982English

Standard Unary Algebras

English

Games and Definability for System F

English

Definability in the Lattice of Ring Varieties

Pacific Journal of Mathematics
Mathematics
1978English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy