Narrow your search

Library

KU Leuven (11)

UCLouvain (10)

UGent (10)

ULiège (7)

ULB (6)

Odisee (5)

Thomas More Kempen (5)

Thomas More Mechelen (5)

UCLL (5)

VIVES (5)

More...

Resource type

book (18)

digital (3)


Language

English (21)


Year
From To Submit

2023 (2)

2019 (1)

2017 (2)

2007 (1)

2003 (1)

More...
Listing 1 - 10 of 21 << page
of 3
>>
Sort by
First-order logic and automated theorem proving
Author:
ISBN: 0387945938 1461275156 1461223601 Year: 1996 Publisher: New York Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

Fundamentals of generalized recursion theory
Author:
ISBN: 9780444861719 0444861718 1299773486 0080960316 9789780080969 9780080961 Year: 1981 Volume: 105 Publisher: Amsterdam ; New York : New York : North-Holland Pub. Co. ; Sole distributors for the U.S.A. and Canada, Elsevier North-Holland,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This work presents the most important combinatorial ideas in partition calculus and discusses ordinary partition relations for cardinals without the assumption of the generalized continuum hypothesis. A separate section of the book describes the main partition symbols scattered in the literature. A chapter on the applications of the combinatorial methods in partition calculus includes a section on topology with Arhangel'skii's famous result that a first countable compact Hausdorff space has cardinality, at most continuum. Several sections on set mappings are included as well as an account of r

Fundamentals of generalized recursion theory
Author:
ISBN: 9780444861719 0444861718 9789780080969 9780080961 9780444861573 0444861572 9780444537454 0444537457 1299773486 9781299773486 9780080954998 0080954995 Year: 1981 Publisher: New York Sole distributors for the U.S.A. and Canada, Elsevier North-Holland

Loading...
Export citation

Choose an application

Bookmark

Abstract

This work presents the most important combinatorial ideas in partition calculus and discusses ordinary partition relations for cardinals without the assumption of the generalized continuum hypothesis. A separate section of the book describes the main partition symbols scattered in the literature. A chapter on the applications of the combinatorial methods in partition calculus includes a section on topology with Arhangel'skii's famous result that a first countable compact Hausdorff space has cardinality, at most continuum. Several sections on set mappings are included as well as an account of recent inequalities for cardinal powers that were obtained in the wake of Silver's breakthrough result saying that the continuum hypothesis can not first fail at a singular cardinal of uncountable cofinality. Provability, Computability and Reflection.

Keywords


Book
Fundamentals of generalized recursion theory
Author:
Year: 1981 Publisher: Amsterdam, New York, Oxford "North-Holland"

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords


Book
Proof methods for modal and intuitionistic logics
Author:
Year: 1983 Publisher: Dordrecht, Boston, Lancaster Reidel

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Computability theory, semantics and logic programming
Author:
ISBN: 0195036913 9780195036916 Year: 1987 Volume: 13 Publisher: Oxford : Oxford University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Programming --- Computer science --- Mathematical logic --- Computable functions --- Data structures (Computer science) --- 681.3*F11 --- 681.3*F41 --- 681.3*I23 --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Electronic data processing --- File organization (Computer science) --- Abstract data types (Computer science) --- Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- Constructive mathematics --- Decidability (Mathematical logic) --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*I23 Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Informatique --- Computer science. --- Sémantique --- Logique mathématique --- Informatique theorique --- Programmation logique


Book
Intuitionistic logic, model theory and forcing
Author:
ISBN: 0720422566 9780444534187 0444534180 9786613838865 0080957730 1283526417 9780720422566 Year: 1969 Publisher: New York : North-Holland,

Proof methods for modal and intuitionistic logics
Author:
ISBN: 9027715734 9048183812 9401727945 9789027715739 Year: 1983 Volume: 169 Publisher: Dordrecht : D. Reidel,


Book
Raymond Smullyan on Self Reference
Authors: ---
ISBN: 3319687328 331968731X 9783319687315 Year: 2017 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book collects, for the first time in one volume, contributions honoring Professor Raymond Smullyan’s work on self-reference. It serves not only as a tribute to one of the great thinkers in logic, but also as a celebration of self-reference in general, to be enjoyed by all lovers of this field. Raymond Smullyan, mathematician, philosopher, musician and inventor of logic puzzles, made a lasting impact on the study of mathematical logic; accordingly, this book spans the many personalities through which Professor Smullyan operated, offering extensions and re-evaluations of his academic work on self-reference, applying self-referential logic to art and nature, and lastly, offering new puzzles designed to communicate otherwise esoteric concepts in mathematical logic, in the manner for which Professor Smullyan was so well known. This book is suitable for students, scholars and logicians who are interested in learning more about Raymond Smullyan's work and life.

Listing 1 - 10 of 21 << page
of 3
>>
Sort by