2004 Summer Meeting of the Association for Symbolic Logic

DOI10.1017/S1079898600003383zbMATH Open1080.03502OpenAlexW2314200632MaRDI QIDQ3370624FDOQ3370624

Author name not available (Why is that?)

Publication date: 8 February 2006

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1079898600003383

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Collections of abstracts of lectures (00B05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fuzzy programming and linear programming with several objective functions
• Fuzzy sets
• On the Addressing Problem for Loop Switching
• Model theory of modules
• Modal languages and bounded fragments of predicate logic
• Untersuchungen über das logische Schliessen. II
• Stability theory, permutations of indiscernibles, and embedded finite models
• A new recursion-theoretic characterization of the polytime functions
• Lattices of suborders
• Basic predicate calculus
• On a canonical representation of fuzzy numbers
• A fuzziness measure for fuzzy numbers: Applications
• Linear programming with fuzzy variables
• Intuitionistic fuzzy logic and intuitionistic fuzzy set theory
• Constructive set theory
• The Uncertain Reasoner's Companion
• A classification of rapidly growing Ramsey functions
• Unification and Passive Inference Rules for Modal Logics
• Fuzzy linear systems
• A logic for default reasoning
• On subtractive varieties. I
• Properties of ideals on the generalized Cantor spaces
• Positive abstraction and extensionality
• Proof-theoretic analysis of termination proofs
• Solving systems of linear fuzzy equations
• Undecidable extensions of Skolem arithmetic
• The strength of some Martin-Löf type theories
• Intuitionistic logic and implicit definability
• Uniform proofs as a foundation for logic programming
• ABSOLUTELY UBIQUITOUS STRUCTURES AND N₀-CATEGORICAL GROUPS
• Rational Pavelka predicate logic is a conservative extension of Łukasiewicz predicate logic
• Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras
• Mal'cev categories and fibration of pointed objects
• Proof-theoretic modal PA-completeness. II: The syntactic countermodel
• A fuzzy linear regression model with better explanatory power
• Computable Boolean algebras
• Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
• Hierarchies of Boolean algebras
• On representing concepts in finite models
• Incompleteness of semantics for intermediate predicate logics, I. Kripke's Semantics
• A sheaf representation and duality for finitely presented Heyting algebras
• Locally finite varieties.
• A definable nonstandard model of the reals
• Dimension of definable sets, algebraic boundedness and Henselian fields
• Derivation lengths and order types of Knuth--Bendix orders
• COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
• The model theory of ordered differential fields
• On the consistency of the Definable Tree Property on ℵ₁
• Topics in invariant descriptive set theory
• SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, II.
• An ideal game
• Arithmetic of divisibility in finite models
• The consistency problem for positive comprehension principles
• Some aspects of generalized computability
• An application of graphical enumeration to PA *
• A note on the axioms for differentially closed fields of characteristic zero
• An effective version of Wilkie's theorem of the complement and some effective o-minimality results.
• Sequent calculus in natural deduction style
• Biclique decompositions and Hermitian rank
• The data type variety of stack algebras
• Soft computing in communications.
• A New Approach to the Activity-time Distribution in PERT
• Completeness theorem for Dummett's LC quantified and some of its extensions
• Variations on a theme by Weiermann
• A term rewriting characterization of the polytime functions and related complexity classes
• On weakening the Deduction Theorem and strengthening Modus Ponens
• More on the Ehrenfeucht–Fraisse game of length ω₁
• Localization of MV-algebras and \(lu\)-groups

Cited In (1)

• 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06

Uses Software

• ETPS

This page was built for publication: 2004 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 Q3370624)