1998 European Summer Meeting of the Association for Symbolic Logic
From MaRDI portal
Publication:4254644
DOI10.2307/421141zbMath0925.03009OpenAlexW2313280230MaRDI QIDQ4254644
No author found.
Publication date: 12 September 1999
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0501-toc.htm
Collections of abstracts of lectures (00B05) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Proof-theoretic analysis of KPM
- Proof methods for modal and intuitionistic logics
- On Lusin's restricted continuum problem
- Self-reference and modal logic
- Partial-predicate logic in computer science
- On alternation
- A propositional logic with explicit fixed points
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Bounds for cut elimination in intuitionistic propositional logic
- Completeness theorem for Dummett's LC quantified and some of its extensions
- Cabal seminar 81-85. Proceedings, Caltech-UCLA logic seminar 1981-1985, Los Angeles, CA (USA)
- Nonstandard hulls of Banach spaces
- On pseudovarieties
- LCF considered as a programming language
- Speaking about transitive frames in propositional languages
- Metamathematics of fuzzy logic
- Some new results on easy lambda-terms
- Full intuitionistic linear logic
- Isabelle. A generic theorem prover
- Cardinal characteristics and the product of countably many infinite cyclic groups
- A typed logic of partial functions reconstructed classically
- On the Jacopini technique
- Nondeterministic stack register machines
- Approximation of analytic by Borel sets and definable countable chain conditions
- Open theories, consistency and related results in fuzzy logic
- Nonstandard characterization of pseudovarieties
- On variable separation in modal and superintuitionistic logics
- Fine-grained opinion, probability, and the logic of full belief
- Logic and computational complexity. International workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994. Selected Papers
- Internal approach to external sets and universes. I: Bounded set theory
- A complete many-valued logic with product-conjunction
- On the strength of Ramsey's theorem
- Splittings
- Neometric spaces
- Many-valued logic and mixed integer programming
- Notation systems for infinitary derivations
- L-fuzzy sets
- Similarity relations and fuzzy orderings
- Aristotle's syllogistic from the standpoint of modern formal logic
- Measure theory and weak König's lemma
- Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
- The Mathematics of Sentence Structure
- Quantales and (noncommutative) linear logic
- Gentzen Games
- Systematization of finite many-valued logics through the method of tableaux
- On parameter free induction schemas
- Contraction-free sequent calculi for intuitionistic logic
- Program size in restricted programming languages
- Global inductive definability
- ON THE GENERAL THEORY OF RELATIONALMORPHISMS
- An Elementary Approach to the Fine Structure of L
- Degrees of finite-state transformability
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Lebesque measure zero subsets of the real line and an infinite game
- Fuzzy sets
- On the size of machines
- On the problem of finding minimal programs for tables
- Fuzzy Logic and the Resolution Principle
- Ramsey's theorem and recursion theory
- A weak completeness theorem for infinite valued first-order logic
- A theorem about infinite-valued sentential logic
This page was built for publication: 1998 European Summer Meeting of the Association for Symbolic Logic
