1998 European Summer Meeting of the Association for Symbolic Logic
From MaRDI portal
Publication:4254644
Cites work
- scientific article; zbMATH DE number 3861143 (Why is no real title available?)
- scientific article; zbMATH DE number 48365 (Why is no real title available?)
- scientific article; zbMATH DE number 50939 (Why is no real title available?)
- scientific article; zbMATH DE number 51769 (Why is no real title available?)
- scientific article; zbMATH DE number 3557754 (Why is no real title available?)
- scientific article; zbMATH DE number 1302869 (Why is no real title available?)
- scientific article; zbMATH DE number 1354791 (Why is no real title available?)
- scientific article; zbMATH DE number 559756 (Why is no real title available?)
- scientific article; zbMATH DE number 976831 (Why is no real title available?)
- scientific article; zbMATH DE number 1024382 (Why is no real title available?)
- scientific article; zbMATH DE number 795569 (Why is no real title available?)
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- scientific article; zbMATH DE number 3353203 (Why is no real title available?)
- scientific article; zbMATH DE number 970828 (Why is no real title available?)
- scientific article; zbMATH DE number 3066797 (Why is no real title available?)
- A complete many-valued logic with product-conjunction
- A propositional logic with explicit fixed points
- A theorem about infinite-valued sentential logic
- A typed logic of partial functions reconstructed classically
- A weak completeness theorem for infinite valued first-order logic
- An Elementary Approach to the Fine Structure of L
- Approximation of analytic by Borel sets and definable countable chain conditions
- Aristotle's syllogistic from the standpoint of modern formal logic
- Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
- Bounds for cut elimination in intuitionistic propositional logic
- Cabal seminar 81-85. Proceedings, Caltech-UCLA logic seminar 1981-1985, Los Angeles, CA (USA)
- Cardinal characteristics and the product of countably many infinite cyclic groups
- Completeness theorem for Dummett's LC quantified and some of its extensions
- Contraction-free sequent calculi for intuitionistic logic
- Degrees of finite-state transformability
- Fine-grained opinion, probability, and the logic of full belief
- Full intuitionistic linear logic
- Fuzzy Logic and the Resolution Principle
- Fuzzy sets
- Gentzen Games
- Global inductive definability
- Internal approach to external sets and universes. I: Bounded set theory
- Isabelle. A generic theorem prover
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Knowledge in flux. Modeling the dynamics of epistemic states
- L-fuzzy sets
- LCF considered as a programming language
- Lebesque measure zero subsets of the real line and an infinite game
- Linear logic
- Logic and computational complexity. International workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994. Selected Papers
- Many-valued logic and mixed integer programming
- Measure theory and weak König's lemma
- Metamathematics of fuzzy logic
- Neometric spaces
- Nondeterministic stack register machines
- Nonstandard characterization of pseudovarieties
- Nonstandard hulls of Banach spaces
- Notation systems for infinitary derivations
- ON THE GENERAL THEORY OF RELATIONALMORPHISMS
- On Lusin's restricted continuum problem
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On alternation
- On parameter free induction schemas
- On pseudovarieties
- On the Jacopini technique
- On the problem of finding minimal programs for tables
- On the size of machines
- On the strength of Ramsey's theorem
- On variable separation in modal and superintuitionistic logics
- Open theories, consistency and related results in fuzzy logic
- Partial-predicate logic in computer science
- Program size in restricted programming languages
- Proof methods for modal and intuitionistic logics
- Proof-theoretic analysis of KPM
- Quantales and (noncommutative) linear logic
- Ramsey's theorem and recursion theory
- Self-reference and modal logic
- Similarity relations and fuzzy orderings
- Some new results on easy lambda-terms
- Speaking about transitive frames in propositional languages
- Splittings
- Systematization of finite many-valued logics through the method of tableaux
- The Mathematics of Sentence Structure
This page was built for publication: 1998 European Summer Meeting of the Association for Symbolic Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254644)
