21.
Lógica dinámica con operadores ambiguos
- Artigas Prous, Josep
El almacenaje de Cooper es una técnica que ha sido desarrollada para tratar la ambigüedad semántica causada por el alcance de los cuantificadores.
22.
Lógica dinámica con operadores ambiguos
- Artigas Prous, Josep
El almacenaje de Cooper es una técnica que ha sido desarrollada para tratar la ambigüedad semántica causada por el alcance de los cuantificadores.
23.
Tableaux e indução na lógica do plausível
- Luiz Henrique da Cruz Silvestrini
Em 1999, Grácio introduziu a Lógica do Plausível como uma particularização de uma família de sistemas lógicos, caracterizados pela inclusão de um quantificador generalizado na sintaxe da lógica clássica de predicados, a saber, as Lógicas Moduladas, cuja formalização semântica é dada por um subconjunto do conjunto das partes do universo.
24.
A Strong Model of Paraconsistent Logic
- Esser, Olivier
The purpose of this paper is mainly to give a model of paraconsistent
logic satisfying the "Frege comprehension scheme" in which we can develop
standard set theory (and even much more as we shall see).
25.
Intuitionistic Completeness and Classical Logic
- McCarty, D. C.
We show that, if a suitable intuitionistic metatheory proves that consistency implies satisfiability for subfinite sets of propositional formulas relative either to standard structures or to Kripke models, then that metatheory also proves every negative instance of every classical propositional tautology.
26.
Introduction to mathematical logic - A problem solving course
- Miller, Arnold W.
Topics covered are:
propositional logic
axioms of ZFC
wellorderings and equivalents of AC
ordinal and cardinal arithmetic
first order logic, and the compactness theorem
Lowenheim-Skolem theorems
Turing machines, Church's Thesis
completeness theorem and first incompleteness theorem
undecidable theories
second incompleteness theorem.
27.
Topological Completeness for Higher-Order Logic
- Awodey, Steve; Butz, Carsten
Using recent results in topos theory, two systems of
higher-order logic are shown to be complete with respect to sheaf
models over topological spaces---so-called ``topological semantics''.
28.
Polynomial time logic: Inability to express
- Shelah, Saharon
Here we deal with the logic of [GuSh 533], which tries to capture polynomial
time (for finite models).
29.
Disjunctive Quantum Logic in Dynamic Perspective
- Coecke, Bob
In arXiv: math.LO/0011208 we proposed the {\sl intuitionistic or disjunctive
representation of quantum logic}, i.e., a representation of the property
lattice of physical systems as a complete Heyting algebra of logical
propositions on these properties, where this complete Heyting algebra goes
equipped with an additional operation, the {\sl operational resolution}, which
identifies the properties within the logic of propositions.
30.
Interpolation and the Interpretability Logic of PA
- Goris, Evan
In this paper we will be concerned with the interpretability logic of PA
and in particular with the fact that this logic, which is denoted by ILM,
does not have the interpolation property.
31.
Quantum Logic in Intuitionistic Perspective
- Coecke, Bob
whereas for logicians the orthocomplementation properties of
negation were the ones least able to withstand a critical analysis, the study
of mechanics points to the distributive identities as the weakest link in the
algebra of logic." In this paper we eliminate this dilemma, providing a way for
maintaining both.
32.
Nonstandard Consequence Operators Generated By Mixed Logic-Systems
- Herrmann, Robert A.
Mixed logic-systems contain both standard and nonstandard coordinate values.
33.
A KANTIAN LECTURE OF STANDARD DEONTIC LOGIC
- Gisele Dalva Secco
A presente dissertação é o resultado de uma investigação acerca da semântica para lógica deôntica standard.
34.
Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic
- Baaz, Matthias; Zach, Richard
Takeuti and Titani have introduced and investigated a logic they called
intuitionistic fuzzy logic.
35.
Decidability of quantified propositional intuitionistic logic and S4 on
trees
- Zach, Richard
Quantified propositional intuitionistic logic is obtained from propositional
intuitionistic logic by adding quantifiers \forall p, \exists p over
propositions.
36.
Graph-Based Logic and Sketches II: Finite-Product Categories and
Equational Logic (Preliminary Report)
- Bagchi, Atish; Wells, Charles
It is shown that the proof theory for sketches and forms provided in Part I
of this paper (see http://www.cwru.edu/1/class/mans/math/pub/wells) is strong
enough to produce all the theorems of the entailment system for multisorted
equational logic provided in Goguen and Meseguer's article ``Completeness of
many-sorted equational logic'' (Technical Report CSL-135, SRI International
Computer Science Laboratory, 333 Ravenswood Ave., Menlo Park, CA 94025, USA,
1982).
37.
OTTER Experiments in a System of Combinatory Logic
- Jech, Thomas
This paper describes some experiments involving the automated theorem-proving
program OTTER in the system TRC of illative combinatory logic.
38.
The logic of interactive Turing reduction
- Japaridze, Giorgi
This concept — more precisely, the associated
concept of reducibility — is a generalization of Turing reducibility from the traditional,
input/output sorts of problems to computational tasks of arbitrary degrees of interactivity.
39.
Categorical Abstract Algebraic Logic: More on Protoalgebraicity
- Voutsadakis, George
Protoalgebraic logics are characterized by the monotonicity of the Leibniz operator on their theory lattices and are at the lower end of the Leibniz hierarchy of abstract algebraic logic.
40.
Modelización mediante lógica difusa del mecanismo biológico regulador de la glucemia
- Sánchez Romero, Jose Luis; Ruiz Fernández, Daniel; Ferrández Pastor, Francisco Javier; García Chamizo, Juan Manuel; Soriano Payá, Antonio
La diabetes mellitus es una patología relacionada con
una deficiente regulación de la glucemia.
