Pages that link to "Item:Q5791200"

The following pages link to The completeness of the first-order functional calculus (Q5791200):

Displaying 50 items.

• Current trends in substructural logics (Q266641) (← links)
• A collapse theorem for holographic algorithms with matchgates on domain size at most 4 (Q476175) (← links)
• Completeness in hybrid type theory (Q484101) (← links)
• Prior on the semantics of modal and tense logic (Q516414) (← links)
• Graded hypothesis theories (Q673394) (← links)
• Kripke semantics for higher-order type theory applied to constraint logic programming languages (Q683712) (← links)
• Revising Carnap's semantic conception of modality (Q694493) (← links)
• Completeness of the functional calculus of first order (Q766671) (← links)
• The algebraic treatment of the methodology of elementary deductive systems (Q766673) (← links)
• Undecidable problems of elementary number theory (Q769606) (← links)
• Investigations in many-sorted quantor logic (Q774393) (← links)
• The seven virtues of simple type theory (Q946569) (← links)
• A categorical study on the finiteness of specifications (Q975404) (← links)
• HasCasl: integrated higher-order specification and program development (Q1006648) (← links)
• Interval logics with applications to study of tense and aspect in English (Q1145690) (← links)
• A completeness theorem for the general interpreted modal calculus MC**nu of A. Bressan (Q1163535) (← links)
• Experimental logics and \(\Delta^0_2\)-theories (Q1222647) (← links)
• Investigations into quantified modal logic. I (Q1227597) (← links)
• Completeness theorems for continuous functions and product topologies (Q1232838) (← links)
• A study of Kripke-type models for some modal logics by Gentzen's sequential method (Q1257012) (← links)
• First order logic with empty structures (Q1262299) (← links)
• Gödel's completeness theorem (Q1312692) (← links)
• Axiomatisation and decidability of \(F\) and \(P\) in cyclical time (Q1319266) (← links)
• A decidable multi-modal logic of context (Q1414576) (← links)
• Mathematical modal logic: A view of its evolution (Q1422628) (← links)
• The natural deduction systems for the three-valued nonsense logics Z and E (Q1647261) (← links)
• Distributed first order logic (Q1686336) (← links)
• Canonical extensions and ultraproducts of polarities (Q1800462) (← links)
• Prior-type modal logic. II (Q1844815) (← links)
• Skolem redux (Q1860974) (← links)
• Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic (Q1884882) (← links)
• Theory of completeness for logical spaces (Q1931338) (← links)
• Event-based time-stamped claim logic (Q2043818) (← links)
• Efficient elimination of Skolem functions in \(\text{LK}^\text{h} \) (Q2144618) (← links)
• Completeness in equational hybrid propositional type theory (Q2278838) (← links)
• Natural deduction system for three-valued Heyting's logic (Q2403575) (← links)
• Beyond Rasiowa's algebraic approach to non-classical logics (Q2498364) (← links)
• A modest logic of plurals (Q2499303) (← links)
• A modal proof theory for final polynomial coalgebras (Q2503317) (← links)
• Completeness of calculii for axiomatically defined classes of algebras (Q2556880) (← links)
• Nicht-Standardmodelle der Zahlentheorie (Q2562781) (← links)
• Neutral free logic: motivation, proof theory and models (Q2698548) (← links)
• Classifying categories for partial equational logic (Q2842828) (← links)
• An infinitary system for the least fixed-point logic restricted to finite models (Q2866740) (← links)
• Completing the Riesz-Dunford functional calculus (Q3034390) (← links)
• The compactness of first-order logic:from gödel to lindström (Q3141183) (← links)
• Model Theory for the Higher Order Predicate Calculus (Q3260562) (← links)
• From Pictures to Semantical Games: Hintikka’s Journey Through Semantic Representationalism (Q3299571) (← links)
• Lindenbaum’s Lemma via Open Induction (Q3305552) (← links)
• The Number of Logical Values (Q3305657) (← links)