The following pages link to Nissim Francez (Q174819):
Displaying 50 items.
- The Lambek calculus extended with intuitionistic propositional logic (Q332086) (← links)
- When are different type-logical semantic definitions defining equivalent meanings? (Q439958) (← links)
- A note on harmony (Q452347) (← links)
- Relational semantics of the Lambek calculus extended with classical propositional logic (Q456962) (← links)
- Bilateralism in proof-theoretic semantics (Q484102) (← links)
- A logic inspired by natural language: quantifiers as subnectors (Q484201) (← links)
- On harmony and permuting conversions (Q518743) (← links)
- Product properties and their direct verification (Q594575) (← links)
- On Beall's new interpretation of \(WK_{3}\) (Q667921) (← links)
- A proof-theoretic semantics for adjectival modification (Q683680) (← links)
- Complete proof rules for strong fairness and strong extreme fairness (Q685427) (← links)
- On the non-compactness of the class of program schemas (Q759008) (← links)
- A weakest precondition semantics for communicating processes (Q789174) (← links)
- A linear-history semantics for languages for distributed programming (Q796298) (← links)
- A `natural logic' inference system using the Lambek calculus (Q851198) (← links)
- A proof-theoretic universal property of determiners (Q893600) (← links)
- Commutation-augmented pregroup grammars and push-down automata with cancellation (Q948066) (← links)
- Proof-theoretic semantics for subsentential phrases (Q969428) (← links)
- Extending free pregroups with lower bounds (Q993496) (← links)
- Game semantics for the Lambek-calculus: Capturing directionality and the absence of structural rules (Q1005955) (← links)
- Decomposition of distributed programs into communication-closed layers (Q1051420) (← links)
- Extended naming conventions for communicating processes (Q1052819) (← links)
- Script: A communication abstraction mechanism and its verification (Q1064053) (← links)
- A complete rule for equifair termination (Q1088401) (← links)
- Fairness and the axioms of control predicates (Q1104729) (← links)
- Infinite trees, markings, and well-foundedness (Q1112586) (← links)
- Appraising fairness in languages for distributed programming (Q1112589) (← links)
- Fairness in context-free grammars under every choice-strategy (Q1122988) (← links)
- A logic-based approach to program flow analysis (Q1130162) (← links)
- On equivalence-completions of fairness assumptions (Q1205189) (← links)
- Backtracking in recursive computations (Q1238623) (← links)
- A proof method for cyclic programs (Q1242445) (← links)
- A case for a forward predicate transformer (Q1247746) (← links)
- Fairness and hyperfairness in multi-party interactions (Q1261113) (← links)
- Off-line parsability and the well-foundedness of subsumption (Q1285865) (← links)
- Similarity preservation in default logic (Q1306758) (← links)
- Program composition via unification (Q1331925) (← links)
- Finite-memory automata (Q1341718) (← links)
- Finite-state unification automata and relational languages (Q1341772) (← links)
- An algebraic characterization of deterministic regular languages over infinite alphabets. (Q1426447) (← links)
- A proof-theoretic semantics for exclusion (Q1689564) (← links)
- Diversification of object-languages for propositional logics (Q1711508) (← links)
- Unification grammars and off-line parsability (Q1777374) (← links)
- Corrigenda:Cooperating proofs for distributed programs with multiparty interactions (Q1813353) (← links)
- Calculi for many-valued logics (Q2045004) (← links)
- Poly-connexivity: connexive conjunction and disjunction (Q2080698) (← links)
- Harmony in multiple-conclusion natural-deduction (Q2254564) (← links)
- On a distinction of two facets of meaning and its role in proof-theoretic semantics (Q2342803) (← links)
- Structural rules for multi-valued logics (Q2418014) (← links)
- Bilateralism, trilateralism, multilateralism and poly-sequents (Q2421519) (← links)
