scientific article

From MaRDI portal
Publication:3993251

zbMath0678.03001MaRDI QIDQ3993251

John Etchemendy, Jon Barwise

Publication date: 17 September 1992


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (81)

Dynamic semantics and circular propositionsA contextual-hierarchical approach to truth and the liar paradoxON DOUBLE-MEMBERSHIP GRAPHS OF MODELS OF ANTI-FOUNDATIONConstruction of Truth Predicates: Approximation Versus RevisionCONSERVATIVELY EXTENDING CLASSICAL LOGIC WITH TRANSPARENT TRUTHNon-well-founded sets via revision rulesReconciling Austinian and Russellian accounts of the liar paradoxAnnual Meeting of the Association for Symbolic Logic, Durham, 1992General information in relevant logicAnti-admissible setsA generalized quantifier logic for naked infinitivesA Co-inductive Language and Truth DegreesLevels of abstraction and the Turing testUncertainty, predictability and decidability in chaotic dynamical systemsIssues in commonsense set theoryTruth and the liar in De Morgan-valued modelsCommon knowledge: Relating anti-founded situation semantics to modal logic neighbourhood semanticsEuropean summer meeting of the Association for Symbolic LogicParadox, ZF, and the Axiom of FoundationProcesses as terms: non-well-founded models for bisimulationHYPERSOLVER: A graphical tool for commonsense set theoryIntention is choice with commitmentTruth, reflection and hierarchiesA constructive sequence algebra for the calculus of indicationsAnnual Meeting of the Association for Symbolic Logic, Pittsburgh, 1991An algebraic theory of structured objectsA remark on probabilistic measures of coherenceConditionals in theories of truthLogic of knowledge and utterance and the liarPlatitudes against paradoxFrom compositional to systematic semanticsA guide to truth predicates in the modern eraStandard foundations for nonstandard analysisIs weak supplementation analytic?A FULLY CLASSICAL TRUTH THEORY CHARACTERIZED BY SUBSTRUCTURAL MEANSInfinite trees and completely iterative theories: A coalgebraic viewNonwellfounded sets and programming language semanticsNew architectures for constructed complex systemsVirtual worlds as meeting places for formal systemsBicontextualismComputer proofs about finite and regular sets: The unifying concept of subvariance.The liar paradox and ``meaningless revenge\(\in_K\): a non-Fregean logic of explicit knowledgeModelling deep indeterminacyParadoxes and the limits of theorizing about propositional attitudesVier Philosophen über semantische ParadoxienContextualism, relativism and the liarSelf-referential propositionsA Comparative Taxonomy of Medieval and Modern Approaches to Liar SentencesA UNIFIED THEORY OF TRUTH AND PARADOXHypercomputation by definitionLogical feedbackHypersetsTowards a non-classical meta-theory for substructural approaches to paradoxFormal semantics for mutual beliefNon-classical elegance for sequent calculus enthusiastsQal wa- omer and Theory of Massive-Parallel ProofsA Coalgebraic View of Infinite Trees and IterationOn meaningfulness and truth\(p\)-adic physics, non-well-founded reality and unconventional computingCOORDINATE-FREE LOGICA variant of Thomason's first-order logic CF based on situationsA Kripkean approach to unknowability and truthParametric corecursionSemantic paradoxes as equations.Against stepping back: A critique of contextualist approaches to the semantic paradoxesUnnamed ItemThe graph conception of setTwo types of deflationismSemantics for existential graphsDeflationary truth and the LiarAlexandre Koyré in the ``Mekka of mathematics. Koyré's Göttingen draft of the dissertationWhat the Liar taught AchillesLazy evaluations in Łukasiewicz type fuzzy logicEXCEPTIONAL LOGICTowards an integration science. The influence of Richard Bellman on our research.Situation Theory ReconsideredClassical Logic and the LiarNonsetsContextual-hierarchical reconstructions of the strengthened liar problemA derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets




This page was built for publication: