Results 221 to 230 of about 11,463 (263)
Some of the next articles are maybe not open access.
Logical Aspects of Combinatorial Duality
Canadian Mathematical Bulletin, 1984AbstractD. R. Woodall has introduced closely-related notions of Menger and König duals which can be applied to a broad range of combinatorial contexts. The present paper considers these two notions for finite ground sets in terms of syntactic duality principles. Specific graph-theoretic interpretations are cited.
openaire +1 more source
2005
The paper presents the connection between λ-calculus and cartesian closed categories both in an untyped and purely syntactic setting. More specifically we establish a syntactic equivalence theorem between what we call categorical combinatory logic and λ-calculus with explicit products and projections, with β and þ-rules as well as with surjective ...
openaire +1 more source
The paper presents the connection between λ-calculus and cartesian closed categories both in an untyped and purely syntactic setting. More specifically we establish a syntactic equivalence theorem between what we call categorical combinatory logic and λ-calculus with explicit products and projections, with β and þ-rules as well as with surjective ...
openaire +1 more source
Combinatory Logic and the Semantics of Substructural Logics
Studia Logica, 2007In his earlier paper ``Combinator logics'' [ibid. 76, No. 1, 17--66 (2004; Zbl 1054.03019)] the author extended the positive relevance logic Bo, with and, or and o (fusion) by o-axioms related to the reduction rules of a set of combinators. He then extended the Routley-Meyer semantics to this extended logic.
openaire +2 more sources
1994
Abstract In preparation for the fixed point theorems of the next chapter, we must turn to some basics of axiomatic combinatory logic.
openaire +1 more source
Abstract In preparation for the fixed point theorems of the next chapter, we must turn to some basics of axiomatic combinatory logic.
openaire +1 more source
Combinatory logic with discriminators
The Journal of Symbolic Logic, 1970In this paper, I present a modified and extended version of combinatory logic. Schönfinkel originated the study of combinatory logic (in [2]), but its development is primarily due to H. B. Curry. In the present paper, I will make use of both the symbolism (with some modification) and the results of Curry, as found in [1].What is novel about my version ...
openaire +2 more sources
Some Combinatorial Logic Examples
2017The entire point of Shannon's 1948 “A Mathematical Theory of Communication” was to study the theoretical limits on the transmission of information from point A (the source) to point B (the receiver) through an intervening medium (the channel). The information is imagined first to be encoded in some manner before being sent through the channel.
openaire +1 more source
The Existence of Combinatory Algebras: Combinatory Logic
1993If the reader has tried to manufacture a useful example of a combinatory algebra for himself, at some stage he will blame me for doing away, along with type differences with a great deal of mathematical intuition. Indeed in this connection the step from the possible to the contradictory has been made by various mathematicians. From the point of view of
openaire +1 more source
Parentheses in Combinatory Logic
1975Publisher Summary This chapter discusses parentheses in combinatory logic. In Church's formulation of type theory based on the calculi of λ-conversion, unique readability is lost by omitting the parentheses. The chapter discusses forms, which states that some elements of `Vα , are called “variables of type α” and the others are called “constants of ...
openaire +1 more source

